The Experts below are selected from a list of 4986 Experts worldwide ranked by ideXlab platform
Asikur Rahman - One of the best experts on this subject based on the ideXlab platform.
-
more stable ad hoc on demand distance vector routing protocol
Conference on Industrial Electronics and Applications, 2009Co-Authors: Tamanna Afroze, Saikat Sarkar, Aminul Islam, Asikur RahmanAbstract:Unicast routing, which discovers a path between a Source-Destination Pair, is a challenging problem for wireless ad-hoc networks. Mobility demands additional requirements to be fulfilled during path selections. A neighbor v of a node u, is called “stable” if v's relative movement with respect to u is very low. A path between a Source-Destination Pair is called “stable” if it consists of most stable neighbors at each intermediate hops. Certainly it is always desirable that any routing protocol picks up more stable paths. In this paper, we propose a modified version of popular AODV routing protocol which discovers its route for sending packets based on the stability of the path. Using simulation we show that our protocol is smart enough to cope with the mobility of the network. Finally, we discuss some special scenarios in which our proposed protocol performs much better.
Devavrat Shah - One of the best experts on this subject based on the ideXlab platform.
-
optimal throughput delay scaling in wireless networks part i the fluid model
IEEE Transactions on Information Theory, 2006Co-Authors: Abbas El Gamal, J Mammen, Balaji Prabhakar, Devavrat ShahAbstract:Gupta and Kumar (2000) introduced a random model to study throughput scaling in a wireless network with static nodes, and showed that the throughput per Source-Destination Pair is Theta(1/radic(nlogn)). Grossglauser and Tse (2001) showed that when nodes are mobile it is possible to have a constant throughput scaling per Source-Destination Pair. In most applications, delay is also a key metric of network performance. It is expected that high throughput is achieved at the cost of high delay and that one can be improved at the cost of the other. The focus of this paper is on studying this tradeoff for wireless networks in a general framework. Optimal throughput-delay scaling laws for static and mobile wireless networks are established. For static networks, it is shown that the optimal throughput-delay tradeoff is given by D(n)=Theta(nT(n)), where T(n) and D(n) are the throughput and delay scaling, respectively. For mobile networks, a simple proof of the throughput scaling of Theta(1) for the Grossglauser-Tse scheme is given and the associated delay scaling is shown to be Theta(nlogn). The optimal throughput-delay tradeoff for mobile networks is also established. To capture physical movement in the real world, a random-walk (RW) model for node mobility is assumed. It is shown that for throughput of Oscr(1/radic(nlogn)), which can also be achieved in static networks, the throughput-delay tradeoff is the same as in static networks, i.e., D(n)=Theta(nT(n)). Surprisingly, for almost any throughput of a higher order, the delay is shown to be Theta(nlogn), which is the delay for throughput of Theta(1). Our result, thus, suggests that the use of mobility to increase throughput, even slightly, in real-world networks would necessitate an abrupt and very large increase in delay.
Ju Liu - One of the best experts on this subject based on the ideXlab platform.
-
a study on achievable rates for Source Destination Pair in wireless sensor networks
Fuzzy Systems and Knowledge Discovery, 2008Co-Authors: Yuan Zhang, Zhongtian Jia, Ju LiuAbstract:As wireless sensor networks (WSN) become the wave of the future, the performance capability of these networks has become a recent hot topic. Unfortunately, a theoretic capacity for WSN is unknown in general up to the present. In this paper, we look at the achievable rates of WSN. The optimal rates can be found by an exhaustive search through every possible route in the network. This proves to be extremely time-consuming and computationally expensive and is impractical to implement in real world applications. We propose a greedy algorithm to route information from Source to Destination node-a much less expensive alternative to an exhaustive search. Simulation results show that for a restrictive grid topology, the rate achieved by the greedy algorithm reach 95% of the optimal rates. However, for a less restrictive topology, where nodes can have random locations, the performance of the greedy algorithm quickly becomes inadequate.
-
FSKD (5) - A Study on Achievable Rates for Source-Destination Pair in Wireless Sensor Networks
2008 Fifth International Conference on Fuzzy Systems and Knowledge Discovery, 2008Co-Authors: Yuan Zhang, Zhongtian Jia, Ju LiuAbstract:As wireless sensor networks (WSN) become the wave of the future, the performance capability of these networks has become a recent hot topic. Unfortunately, a theoretic capacity for WSN is unknown in general up to the present. In this paper, we look at the achievable rates of WSN. The optimal rates can be found by an exhaustive search through every possible route in the network. This proves to be extremely time-consuming and computationally expensive and is impractical to implement in real world applications. We propose a greedy algorithm to route information from Source to Destination node-a much less expensive alternative to an exhaustive search. Simulation results show that for a restrictive grid topology, the rate achieved by the greedy algorithm reach 95% of the optimal rates. However, for a less restrictive topology, where nodes can have random locations, the performance of the greedy algorithm quickly becomes inadequate.
Lajos Hanzo - One of the best experts on this subject based on the ideXlab platform.
-
Secrecy Outage and Diversity Analysis of Multiple Cooperating Source-Destination Pairs
IEEE Transactions on Vehicular Technology, 2020Co-Authors: Xiaojin Ding, Yulong Zou, Xiaoshu Chen, Xiaojun Wang, Lajos HanzoAbstract:We study the physical-layer security of multiple Source-Destination (SD) Pairs communicating within a wireless network in the face of an eavesdropper attacking the SD Pairs. In order to protect the wireless transmission against eavesdropping, we propose a cooperation framework relying on two stages. Specifically, an SD Pair is selected to access the total allocated spectrum using an appropriately designed scheme at the beginning of the first stage. The other Source nodes (SNs) simultaneously transmit their data to the SN of the above-mentioned SD Pair relying on orthogonal reSources during the first stage. Then, the SN of the chosen SD Pair transmits the data packets containing its own messages and the other SNs’ messages to its dedicated Destination node (DN) in the second stage. Finally, this dedicated DN will forward all the other DNs’ data to the application center via the core network. We conceive a specific SD Pair selection scheme, termed as the transmit antenna selection aided Source-Destination Pair selection (TAS-SDPS). We continue by deriving the secrecy outage probability (SOP) expressions of both the TAS-SDPS conceived, as well as of the conventional round-robin Source-Destination Pair selection (RSDPS) and of the conventional non-cooperative (Non-coop) schemes for comparison. Furthermore, we carry out the secrecy diversity gain analysis in the high main-to-eavesdropper ratio (MER) region, showing that the TAS-SDPS scheme is capable of achieving the maximum attainable secrecy diversity order. Additionally, we show that increasing the number of transmitting Pairs will reduce the SOP, whilst increasing the secrecy diversity order of the TAS-SDPS scheme. It is demonstrated that the SOP of the TAS-SDPS scheme is better than that of the RSDPS and of the conventional Non-coop schemes. We also demonstrate that the secrecy diversity gain of the proposed TAS-SDPS scheme is $M$ times that of the RSDPS scheme in the high-MER region, where $M$ is the number of the SD Pairs.
-
Secrecy Outage and Diversity Analysis of Multiple Cooperative Source-Destination Pairs
arXiv: Information Theory, 2019Co-Authors: Xiaojin Ding, Yulong Zou, Xiaoshu Chen, Xiaojun Wang, Lajos HanzoAbstract:We study the physical-layer security of a multiple Source-Destination (SD) Pairs coexisting wireless network in the face of an eavesdropper, where an eavesdropper intends to wiretap the signal transmitted by the SD Pairs. In order to protect the wireless transmission against eavesdropping, we propose a cooperation framework relying on two stages. Specifically, an SD Pair is selected to access the total allocated spectrum using an appropriately designed scheme at the beginning of the first stage. The other Source nodes (SNs) simultaneously transmit their data to the SN of the above-mentioned SD Pair relying on an orthogonal way during the first stage. Then, the SN of the chosen SD Pair transmits the data packets containing its own messages and the other SNs' messages to its dedicated Destination node (DN) in the second stage, which in turn will forward all the other DNs' data to the application center via the core network. We conceive a specific SD Pair selection scheme, termed as the transmit antenna selection aided Source-Destination Pair selection (TAS-SDPS). We derive the secrecy outage probability (SOP) expressions for the TAS-SDPS, as well as for the conventional round-robin Source-Destination Pair selection (RSDPS) and non-cooperative (Non-coop) schemes for comparison purposes. Furthermore, we carry out the secrecy diversity gain analysis in the high main-to-eavesdropper ratio (MER) region, showing that the TAS-SDPS scheme is capable of achieving the maximum attainable secrecy diversity order.
Tamanna Afroze - One of the best experts on this subject based on the ideXlab platform.
-
more stable ad hoc on demand distance vector routing protocol
Conference on Industrial Electronics and Applications, 2009Co-Authors: Tamanna Afroze, Saikat Sarkar, Aminul Islam, Asikur RahmanAbstract:Unicast routing, which discovers a path between a Source-Destination Pair, is a challenging problem for wireless ad-hoc networks. Mobility demands additional requirements to be fulfilled during path selections. A neighbor v of a node u, is called “stable” if v's relative movement with respect to u is very low. A path between a Source-Destination Pair is called “stable” if it consists of most stable neighbors at each intermediate hops. Certainly it is always desirable that any routing protocol picks up more stable paths. In this paper, we propose a modified version of popular AODV routing protocol which discovers its route for sending packets based on the stability of the path. Using simulation we show that our protocol is smart enough to cope with the mobility of the network. Finally, we discuss some special scenarios in which our proposed protocol performs much better.