The Experts below are selected from a list of 38472 Experts worldwide ranked by ideXlab platform
Ahmed Meddahi - One of the best experts on this subject based on the ideXlab platform.
-
a weighted qos aware multipath Routing Process in mobile ad hoc networks
International Symposium on Computers and Communications, 2013Co-Authors: Mariem Thaalbi, Nabil Tabbane, Tarek Bejaoui, Ahmed MeddahiAbstract:In this paper, we address the quality aware Routing issue in MANET: Mobile Ad hoc networks. The MANET network is based on dynamic radio links. Our contribution improves the multipath Routing in Mobile Ad hoc networks based on the path quality, path stability and QoS awareness. Prediction methods are used in order to estimate the path quality. The paths will be sorted and weighted according to the application class. Route selection Process is based on multi-criteria selection method. Interactions between Routing layer and MAC layer are exploited to get the path quality. To take into account the application class in the Routing Process, cross layer interactions between Routing layer and upper layers are needed. Application' classes will be defined according to the user's requirement thresholds defined by the ITU G-1010 recommendation [1]. A simulation study under NS2 will be conducted in this paper in order to validate our contribution.
-
ISCC - A weighted QoS aware multipath Routing Process in Mobile Ad hoc networks
2013 IEEE Symposium on Computers and Communications (ISCC), 2013Co-Authors: Mariem Thaalbi, Nabil Tabbane, Tarek Bejaoui, Ahmed MeddahiAbstract:In this paper, we address the quality aware Routing issue in MANET: Mobile Ad hoc networks. The MANET network is based on dynamic radio links. Our contribution improves the multipath Routing in Mobile Ad hoc networks based on the path quality, path stability and QoS awareness. Prediction methods are used in order to estimate the path quality. The paths will be sorted and weighted according to the application class. Route selection Process is based on multi-criteria selection method. Interactions between Routing layer and MAC layer are exploited to get the path quality. To take into account the application class in the Routing Process, cross layer interactions between Routing layer and upper layers are needed. Application' classes will be defined according to the user's requirement thresholds defined by the ITU G-1010 recommendation [1]. A simulation study under NS2 will be conducted in this paper in order to validate our contribution.
Yunsheng Wang - One of the best experts on this subject based on the ideXlab platform.
-
hypercube based multipath social feature Routing in human contact networks
IEEE Transactions on Computers, 2014Co-Authors: Yunsheng WangAbstract:Most Routing protocols for delay tolerant networks resort to the sufficient state information, including trajectory and contact information, to ensure Routing efficiency. However, state information tends to be dynamic and hard to obtain without a global and/or long-term collection Process. In this paper, we use the internal social features of each node in the network to perform the Routing Process. In this way, feature-based Routing converts a Routing problem in a highly mobile and unstructured contact space to a static and structured feature space. This approach is motivated from several human contact networks, such as the Infocom 2006 trace and MIT reality mining data, where people contact each other more frequently if they have more social features in common. Our approach includes two unique Processes: social feature extraction and multipath Routing. In social feature extraction, we use entropy to extract the m most informative social features to create a feature space (F-space): (F1, F2,..., Fm), where Fi corresponds to a feature. The Routing method then becomes a hypercube-based feature matching Process, where the Routing Process is a step-by-step feature difference resolving Process. We offer two special multipath Routing schemes: node-disjoint-based Routing and delegation-based Routing. Extensive simulations on both real and synthetic traces are conducted in comparison with several existing approaches, including spray-and-wait Routing, spray-and-focus Routing, and social-aware Routing based on betweenness centrality and similarity. In addition, the effectiveness of multipath Routing is evaluated and compared to that of single-path Routing.
-
analysis of a hypercube based social feature multipath Routing in delay tolerant networks
IEEE Transactions on Parallel and Distributed Systems, 2013Co-Authors: Yunsheng Wang, Weishih YangAbstract:Social behavior plays a more and more important role in delay tolerant networks (DTNs). In this paper, we present an analytical model for a hypercube-based social feature multipath Routing protocol in DTNs. In this Routing protocol, we use the internal social features of each node (individual) in the network for Routing guidance. This approach is motivated from several real social contact networks, which show that people contact each other more when they have more social features in common. This Routing scheme converts a Routing problem in a highly mobile and unstructured contact space (M-space) to a static and structured feature space (F-space). The multipath Routing Process is a hypercube-based feature matching Process where the social feature differences are resolved step-by-step. A feature matching shortcut algorithm for fast searching is presented where more than one feature difference is resolved at one time. The multiple paths for the Routing Process are node-disjoint. We formally analyze the delivery rate and latency by using hypercube-based Routing. The solutions for the expected values of latency and delivery rate are given under different path conditions: single-/multipath and feature difference resolutions with/without shortcuts. Extensive simulations on both real and synthetic traces are conducted in comparison to several existing state-of-the-art DTN Routing protocols.
Mariem Thaalbi - One of the best experts on this subject based on the ideXlab platform.
-
a weighted qos aware multipath Routing Process in mobile ad hoc networks
International Symposium on Computers and Communications, 2013Co-Authors: Mariem Thaalbi, Nabil Tabbane, Tarek Bejaoui, Ahmed MeddahiAbstract:In this paper, we address the quality aware Routing issue in MANET: Mobile Ad hoc networks. The MANET network is based on dynamic radio links. Our contribution improves the multipath Routing in Mobile Ad hoc networks based on the path quality, path stability and QoS awareness. Prediction methods are used in order to estimate the path quality. The paths will be sorted and weighted according to the application class. Route selection Process is based on multi-criteria selection method. Interactions between Routing layer and MAC layer are exploited to get the path quality. To take into account the application class in the Routing Process, cross layer interactions between Routing layer and upper layers are needed. Application' classes will be defined according to the user's requirement thresholds defined by the ITU G-1010 recommendation [1]. A simulation study under NS2 will be conducted in this paper in order to validate our contribution.
-
ISCC - A weighted QoS aware multipath Routing Process in Mobile Ad hoc networks
2013 IEEE Symposium on Computers and Communications (ISCC), 2013Co-Authors: Mariem Thaalbi, Nabil Tabbane, Tarek Bejaoui, Ahmed MeddahiAbstract:In this paper, we address the quality aware Routing issue in MANET: Mobile Ad hoc networks. The MANET network is based on dynamic radio links. Our contribution improves the multipath Routing in Mobile Ad hoc networks based on the path quality, path stability and QoS awareness. Prediction methods are used in order to estimate the path quality. The paths will be sorted and weighted according to the application class. Route selection Process is based on multi-criteria selection method. Interactions between Routing layer and MAC layer are exploited to get the path quality. To take into account the application class in the Routing Process, cross layer interactions between Routing layer and upper layers are needed. Application' classes will be defined according to the user's requirement thresholds defined by the ITU G-1010 recommendation [1]. A simulation study under NS2 will be conducted in this paper in order to validate our contribution.
Weishih Yang - One of the best experts on this subject based on the ideXlab platform.
-
analysis of a hypercube based social feature multipath Routing in delay tolerant networks
IEEE Transactions on Parallel and Distributed Systems, 2013Co-Authors: Yunsheng Wang, Weishih YangAbstract:Social behavior plays a more and more important role in delay tolerant networks (DTNs). In this paper, we present an analytical model for a hypercube-based social feature multipath Routing protocol in DTNs. In this Routing protocol, we use the internal social features of each node (individual) in the network for Routing guidance. This approach is motivated from several real social contact networks, which show that people contact each other more when they have more social features in common. This Routing scheme converts a Routing problem in a highly mobile and unstructured contact space (M-space) to a static and structured feature space (F-space). The multipath Routing Process is a hypercube-based feature matching Process where the social feature differences are resolved step-by-step. A feature matching shortcut algorithm for fast searching is presented where more than one feature difference is resolved at one time. The multiple paths for the Routing Process are node-disjoint. We formally analyze the delivery rate and latency by using hypercube-based Routing. The solutions for the expected values of latency and delivery rate are given under different path conditions: single-/multipath and feature difference resolutions with/without shortcuts. Extensive simulations on both real and synthetic traces are conducted in comparison to several existing state-of-the-art DTN Routing protocols.
Wei Zhao - One of the best experts on this subject based on the ideXlab platform.
-
investigating capsule networks with dynamic Routing for text classification
Empirical Methods in Natural Language Processing, 2018Co-Authors: Wei Zhao, Min Yang, Zeyang Lei, Suofei Zhang, Zhou ZhaoAbstract:In this study, we explore capsule networks with dynamic Routing for text classification. We propose three strategies to stabilize the dynamic Routing Process to alleviate the disturbance of some noise capsules which may contain “background” information or have not been successfully trained. A series of experiments are conducted with capsule networks on six text classification benchmarks. Capsule networks achieve state of the art on 4 out of 6 datasets, which shows the effectiveness of capsule networks for text classification. We additionally show that capsule networks exhibit significant improvement when transfer single-label to multi-label text classification over strong baseline methods. To the best of our knowledge, this is the first work that capsule networks have been empirically investigated for text modeling.
-
on false data injection attacks against distributed energy Routing in smart grid
International Conference on Cyber-Physical Systems, 2012Co-Authors: Jie Lin, Guobin Xu, Xinyu Yang, Wei ZhaoAbstract:Smart Grid is a new type of energy-based cyber physical system (CPS) that will provide reliable, secure, and efficient energy transmission and distribution. The way to secure the distributed energy Routing Process that efficiently utilizes the distributed energy resources and minimizes the energy transmission overhead is essential in smart grid. In this paper, we study the vulnerability of the distributed energy Routing Process and investigate novel false data injection attacks against the energy Routing Process. We consider several general attacks, in which the adversary may manipulate the quantity of energy supply, the quantity of energy response, and the link state of energy transmission. The forged data injected by those attacks will cause imbalanced demand and supply, increase the cost for energy distribution, and disrupt the energy distribution. We formally model these attacks and quantitatively analyze their impact on energy distribution. Our evaluation data show that those attacks can effectively disrupt the effectiveness of energy distribution Process, causing significant supplied energy loss, energy transmission cost and the number of outage users.
-
ICCPS - On False Data Injection Attacks against Distributed Energy Routing in Smart Grid
2012 IEEE ACM Third International Conference on Cyber-Physical Systems, 2012Co-Authors: Jie Lin, Xinyu Yang, Wei ZhaoAbstract:Smart Grid is a new type of energy-based cyber physical system (CPS) that will provide reliable, secure, and efficient energy transmission and distribution. The way to secure the distributed energy Routing Process that efficiently utilizes the distributed energy resources and minimizes the energy transmission overhead is essential in smart grid. In this paper, we study the vulnerability of the distributed energy Routing Process and investigate novel false data injection attacks against the energy Routing Process. We consider several general attacks, in which the adversary may manipulate the quantity of energy supply, the quantity of energy response, and the link state of energy transmission. The forged data injected by those attacks will cause imbalanced demand and supply, increase the cost for energy distribution, and disrupt the energy distribution. We formally model these attacks and quantitatively analyze their impact on energy distribution. Our evaluation data show that those attacks can effectively disrupt the effectiveness of energy distribution Process, causing significant supplied energy loss, energy transmission cost and the number of outage users.
