The Experts below are selected from a list of 23982 Experts worldwide ranked by ideXlab platform
Xiaohong Jiang - One of the best experts on this subject based on the ideXlab platform.
-
Packet Delivery Ratio and energy consumption in multicast delay tolerant MANETs with power control
Computer Networks, 2019Co-Authors: Bin Yang, Yulong Shen, Xiaohong JiangAbstract:Abstract The Packet Delivery Ratio and energy consumption serve as important performance metrics for delay tolerant mobile ad hoc networks (MANETs), where there are not continuous end-to-end paths between mobile nodes. Available these performance studies of MANETs mainly consider a unicast scenario, i.e., one source node has only one destination node, which cannot be applied to evaluate the performance of such networks under a multicast scenario, i.e, one source node has multiple destination nodes. Different from previous studies, the paper investigates the Packet Delivery Ratio and energy consumption under multicast scenario with careful consideRation of transmission power control issue for each node. To this end, we adopt a general two-hop relay RT-(f, d, τ, w) algorithm with redundancy factor f, multicast scale d, Packet lifetime τ and power control parameter w for Packet routing, where a Packet at source node can be delivered to up to f different relay nodes, and each of d destination nodes may receive the Packet from these relay nodes or the source node before the Packet lifetime τ expires. In MANETs, each scenario has a fixed power control parameter w, which is the same for all nodes. Then we develop a Markov chain framework to depict the Packet propagation process under the RT-(f, d, τ, w) algorithm. Based on this framework, we derive two analytical expressions for Packet Delivery Ratio and energy consumption. Finally, simulation and numerical results are provided to validate our theoretical analysis and to explore how the network parameters affect the Packet Delivery Ratio and energy consumption performance.
-
Packet Delivery Ratio cost in manets with erasure coding and Packet replication
IEEE Transactions on Vehicular Technology, 2015Co-Authors: Bin Yang, Yin Chen, Ying Cai, Xiaohong JiangAbstract:This paper studies the performance of a general two-hop relay (2HR)- $(x,w,f) $ Packet Delivery scheme that combines both erasure coding and Packet replication techniques in mobile ad hoc networks (MANETs). Under this Packet Delivery scheme, a group of $x$ Packets is first encoded into $w(w\geq x) $ coded Packets using erasure coding, and each coded Packet is then replicated to at most $f$ distinct relay nodes that can help to forward the coded Packets to its destination node. The original Packets can be recovered when $x$ distinct coded Packets reach the destination node. To understand the Packet Delivery process under the 2HR- $(x,w,f) $ scheme, we develop a multidimensional Markov chain framework, and based on this analytical expressions on the Packet Delivery Ratio and corresponding expected Packet Delivery cost are further derived. Finally, extensive simulation and numerical studies are conducted to illustrate the efficiency of the developed theoretical models and to illustrate our findings. Our results indicate that the replication parameter $f$ should be carefully selected in order to obtain a high Packet-Delivery-Ratio performance while maintaining a relatively low Delivery cost.
-
Packet Delivery Ratio/Cost in MANETs With Erasure Coding and Packet Replication
IEEE Transactions on Vehicular Technology, 2015Co-Authors: Bin Yang, Yin Chen, Ying Cai, Xiaohong JiangAbstract:This paper studies the performance of a general two-hop relay (2HR)- $(x,w,f) $ Packet Delivery scheme that combines both erasure coding and Packet replication techniques in mobile ad hoc networks (MANETs). Under this Packet Delivery scheme, a group of $x$ Packets is first encoded into $w(w\geq x) $ coded Packets using erasure coding, and each coded Packet is then replicated to at most $f$ distinct relay nodes that can help to forward the coded Packets to its destination node. The original Packets can be recovered when $x$ distinct coded Packets reach the destination node. To understand the Packet Delivery process under the 2HR- $(x,w,f) $ scheme, we develop a multidimensional Markov chain framework, and based on this analytical expressions on the Packet Delivery Ratio and corresponding expected Packet Delivery cost are further derived. Finally, extensive simulation and numerical studies are conducted to illustrate the efficiency of the developed theoretical models and to illustrate our findings. Our results indicate that the replication parameter $f$ should be carefully selected in order to obtain a high Packet-Delivery-Ratio performance while maintaining a relatively low Delivery cost.
Naoki Shibata - One of the best experts on this subject based on the ideXlab platform.
-
Providing Reliable Communications over Static-node-assisted Vehicular Networks Using Distance-vector Routing
Mobile Networks and Applications, 2018Co-Authors: Takuya Yoshihiro, Daichi Araki, Hiroki Sakaguchi, Naoki ShibataAbstract:To support various practical applications that are expected to work over vehicular networks, it is important to develop a network infrastructure that provides quality communications on which applications can rely. However, since a vehicular network is essentially a delay tolerant network (DTN) in which connected paths to the destinations do not always exist, providing reliable communications on such a network is a challenging research goal. In this paper, we propose a new table-driven distance-vector routing protocol called RDV (Reliable Distance-Vector routing) for static-node-assisted vehicular networks. RDV provides the guarantee that the expected Packet Delivery Ratio exceeds the preconfigured value by creating the necessary number of Packet copies sent on the shortest path. Evaluation results show that RDV provides a stably high Packet Delivery Ratio and outperforms other conventional routing schemes in both Packet Delivery Ratio and overhead of Packet copies.
-
MobiQuitous - Reliable Distance-Vector Routing for Static-node-assisted Vehicular Networks
Proceedings of the 13th International Conference on Mobile and Ubiquitous Systems: Computing Networking and Services, 2016Co-Authors: Takuya Yoshihiro, Daichi Araki, Hiroki Sakaguchi, Naoki ShibataAbstract:We propose a new static-node-assisted routing scheme RDV (Reliable Distance Vector routing) for vehicular networks. In RDV, static nodes located at intersections behave as distance-vector routers to assist Packet forwarding, i.e., they exchange messages, compute paths, and help Packets travel along the computed forwarding paths to their destinations. To support various practical applications over vehicular networks, RDV provides reliable communications such that the average Packet Delivery Ratio exceeds the preconfigured Delivery Ratio by creating the necessary number of Packet copies sent on the shortest path. Evaluation results show that the proposed scheme provides stably high Packet Delivery Ratio, and outperforms other existing routing schemes in both Packet Delivery Ratio and the number of generated Packet copies.
Riku Jantti - One of the best experts on this subject based on the ideXlab platform.
-
channel ranking based on Packet Delivery Ratio estimation in wireless sensor networks
Wireless Communications and Networking Conference, 2013Co-Authors: Hamidreza Shariatmadari, Aamir Mahmood, Riku JanttiAbstract:Wireless sensor networks (WSNs) operating in 2.4 GHz unlicensed bands must explore favorable channels in order to mitigate the effects of induced interference by co-existing wireless systems and frequency selective fading. In this context, we develop a Packet Delivery Ratio (PDR) estimation method for channel ranking in WSNs. The PDR, in general, is defined as a function of signal-to-noise Ratio (SNR) and signal-to-interferenceplus-noise Ratio (SINR) at the sensor and the Packet collision-time distribution of the sensor link. The collision-time distribution depends on the Packet size and Packet inter-arrival time distributions of both networks. Under limited channel measurements, the collision-time cannot be estimated satisfactorily. In order to bypass the collision-time estimation process, the proposed PDR estimation method utilizes signal level, interference and noise characteristics identified by spectrum measurements adjusted to the intended traffic pattern of the sensor link. The proposed method is validated against the empirical PDR using off-the-shelf sensor platform in emulated multi path wireless fading channels. The results reveal that the method is accurate in modeling the empirical PDR with limited channel energy measurements. In addition, we used the estimated PDR as a metric for channel ranking and verified its effectiveness by ranking the available channels to a WSN under interference from multiple WLANs in a real environment.
-
WCNC - Channel ranking based on Packet Delivery Ratio estimation in wireless sensor networks
2013 IEEE Wireless Communications and Networking Conference (WCNC), 2013Co-Authors: Hamidreza Shariatmadari, Aamir Mahmood, Riku JanttiAbstract:Wireless sensor networks (WSNs) operating in 2.4 GHz unlicensed bands must explore favorable channels in order to mitigate the effects of induced interference by co-existing wireless systems and frequency selective fading. In this context, we develop a Packet Delivery Ratio (PDR) estimation method for channel ranking in WSNs. The PDR, in general, is defined as a function of signal-to-noise Ratio (SNR) and signal-to-interferenceplus-noise Ratio (SINR) at the sensor and the Packet collision-time distribution of the sensor link. The collision-time distribution depends on the Packet size and Packet inter-arrival time distributions of both networks. Under limited channel measurements, the collision-time cannot be estimated satisfactorily. In order to bypass the collision-time estimation process, the proposed PDR estimation method utilizes signal level, interference and noise characteristics identified by spectrum measurements adjusted to the intended traffic pattern of the sensor link. The proposed method is validated against the empirical PDR using off-the-shelf sensor platform in emulated multi path wireless fading channels. The results reveal that the method is accurate in modeling the empirical PDR with limited channel energy measurements. In addition, we used the estimated PDR as a metric for channel ranking and verified its effectiveness by ranking the available channels to a WSN under interference from multiple WLANs in a real environment.
Bin Yang - One of the best experts on this subject based on the ideXlab platform.
-
Packet Delivery Ratio and energy consumption in multicast delay tolerant MANETs with power control
Computer Networks, 2019Co-Authors: Bin Yang, Yulong Shen, Xiaohong JiangAbstract:Abstract The Packet Delivery Ratio and energy consumption serve as important performance metrics for delay tolerant mobile ad hoc networks (MANETs), where there are not continuous end-to-end paths between mobile nodes. Available these performance studies of MANETs mainly consider a unicast scenario, i.e., one source node has only one destination node, which cannot be applied to evaluate the performance of such networks under a multicast scenario, i.e, one source node has multiple destination nodes. Different from previous studies, the paper investigates the Packet Delivery Ratio and energy consumption under multicast scenario with careful consideRation of transmission power control issue for each node. To this end, we adopt a general two-hop relay RT-(f, d, τ, w) algorithm with redundancy factor f, multicast scale d, Packet lifetime τ and power control parameter w for Packet routing, where a Packet at source node can be delivered to up to f different relay nodes, and each of d destination nodes may receive the Packet from these relay nodes or the source node before the Packet lifetime τ expires. In MANETs, each scenario has a fixed power control parameter w, which is the same for all nodes. Then we develop a Markov chain framework to depict the Packet propagation process under the RT-(f, d, τ, w) algorithm. Based on this framework, we derive two analytical expressions for Packet Delivery Ratio and energy consumption. Finally, simulation and numerical results are provided to validate our theoretical analysis and to explore how the network parameters affect the Packet Delivery Ratio and energy consumption performance.
-
Packet Delivery Ratio cost in manets with erasure coding and Packet replication
IEEE Transactions on Vehicular Technology, 2015Co-Authors: Bin Yang, Yin Chen, Ying Cai, Xiaohong JiangAbstract:This paper studies the performance of a general two-hop relay (2HR)- $(x,w,f) $ Packet Delivery scheme that combines both erasure coding and Packet replication techniques in mobile ad hoc networks (MANETs). Under this Packet Delivery scheme, a group of $x$ Packets is first encoded into $w(w\geq x) $ coded Packets using erasure coding, and each coded Packet is then replicated to at most $f$ distinct relay nodes that can help to forward the coded Packets to its destination node. The original Packets can be recovered when $x$ distinct coded Packets reach the destination node. To understand the Packet Delivery process under the 2HR- $(x,w,f) $ scheme, we develop a multidimensional Markov chain framework, and based on this analytical expressions on the Packet Delivery Ratio and corresponding expected Packet Delivery cost are further derived. Finally, extensive simulation and numerical studies are conducted to illustrate the efficiency of the developed theoretical models and to illustrate our findings. Our results indicate that the replication parameter $f$ should be carefully selected in order to obtain a high Packet-Delivery-Ratio performance while maintaining a relatively low Delivery cost.
-
Packet Delivery Ratio/Cost in MANETs With Erasure Coding and Packet Replication
IEEE Transactions on Vehicular Technology, 2015Co-Authors: Bin Yang, Yin Chen, Ying Cai, Xiaohong JiangAbstract:This paper studies the performance of a general two-hop relay (2HR)- $(x,w,f) $ Packet Delivery scheme that combines both erasure coding and Packet replication techniques in mobile ad hoc networks (MANETs). Under this Packet Delivery scheme, a group of $x$ Packets is first encoded into $w(w\geq x) $ coded Packets using erasure coding, and each coded Packet is then replicated to at most $f$ distinct relay nodes that can help to forward the coded Packets to its destination node. The original Packets can be recovered when $x$ distinct coded Packets reach the destination node. To understand the Packet Delivery process under the 2HR- $(x,w,f) $ scheme, we develop a multidimensional Markov chain framework, and based on this analytical expressions on the Packet Delivery Ratio and corresponding expected Packet Delivery cost are further derived. Finally, extensive simulation and numerical studies are conducted to illustrate the efficiency of the developed theoretical models and to illustrate our findings. Our results indicate that the replication parameter $f$ should be carefully selected in order to obtain a high Packet-Delivery-Ratio performance while maintaining a relatively low Delivery cost.
Sylvie Perreau - One of the best experts on this subject based on the ideXlab platform.
-
maximizing Packet Delivery Ratio in stochastic routing an analytical perspective
International Conference on Communications, 2014Co-Authors: Udara Wijetunge, Ramanan Subramanian, Andre Pollok, Sylvie PerreauAbstract:Stochastic routing offers a promising substitute to deterministic routing in wireless sensor networks, mainly due to its randomized nature. Still, most of the stochastic routing algorithms are heuristic, while the optimality for a given degree of randomness is difficult to find. In this paper, we propose a theoretical framework to find the optimal stochastic routing policy that maximizes the Packet Delivery Ratio for a given degree of randomness in routing. Our model consists of directed acyclic networks with unreliable communication links. The degree of randomness is quantified by the global entropy of routing. By employing the Lagrangian approach, a simple iterative algorithm to find the optimal stochastic routing policy is proposed. This can be used as a benchmark for performance comparison of stochastic routing algorithms.
-
ICC - Maximizing Packet Delivery Ratio in stochastic routing: An analytical perspective
2014 IEEE International Conference on Communications (ICC), 2014Co-Authors: Udara Wijetunge, Ramanan Subramanian, Andre Pollok, Sylvie PerreauAbstract:Stochastic routing offers a promising substitute to deterministic routing in wireless sensor networks, mainly due to its randomized nature. Still, most of the stochastic routing algorithms are heuristic, while the optimality for a given degree of randomness is difficult to find. In this paper, we propose a theoretical framework to find the optimal stochastic routing policy that maximizes the Packet Delivery Ratio for a given degree of randomness in routing. Our model consists of directed acyclic networks with unreliable communication links. The degree of randomness is quantified by the global entropy of routing. By employing the Lagrangian approach, a simple iterative algorithm to find the optimal stochastic routing policy is proposed. This can be used as a benchmark for performance comparison of stochastic routing algorithms.
-
AusCTW - Fault-tolerant stochastic routing for wireless sensor networks with unreliable links
2013 Australian Communications Theory Workshop (AusCTW), 2013Co-Authors: Udara Wijetunge, Andre Pollok, Sylvie PerreauAbstract:Timely and reliable Delivery of critical information is vital for military applications and disaster relief applications. Such applications rely on communications networks, which in practice operate via unreliable links. Improving the Packet Delivery Ratio while reducing the end-to-end delay is a major challenge for stochastic routing in networks with unreliable communication links. In this paper, we propose a novel decentralized stochastic routing algorithm to improve the Packet Delivery Ratio and end-to-end delay for wireless sensor networks (WSNs) with unreliable links. We introduce an evaluation framework based on discrete time absorbing Markov chains to evaluate the Packet Delivery Ratio and end-to-end delay. Simulation results show that our proposed routing algorithm performs significantly better in terms of Packet Delivery Ratio and end-to-end delay when compared to existing decentralized methods.
