Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Distributed Algorithms for Unidirectional Networks
SIAM Journal on Computing
Routing in communications networks
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Simulation-based performance evaluation of routing protocols for mobile ad hoc networks
Mobile Networks and Applications
Channel access scheduling in Ad Hoc networks with unidirectional links
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Proceedings of the 2nd International Workshop on Distributed Algorithms
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
The K-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Connectivity of wireless multihop networks in a shadow fading environment
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
Experimental evaluation of wireless simulation assumptions
MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
EUDA: detecting and avoiding unidirectional links in ad hoc networks
ACM SIGMOBILE Mobile Computing and Communications Review
MicroRouting: A Scalable and Robust Communication Paradigm for Sparse Ad Hoc Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Salvaging route reply for on-demand routing protocols in mobile ad-hoc networks
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Topology control in wireless ad hoc and sensor networks
ACM Computing Surveys (CSUR)
The k-Neighbors Approach to Interference Bounded and Symmetric Topology Control in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Handling asymmetry in power heterogeneous ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance evaluation of multicast ad hoc on-demand distance vector protocol
Computer Communications
Effects of unstable links on AODV performance in real testbeds
EURASIP Journal on Wireless Communications and Networking
BRA: a bidirectional routing abstraction for asymmetric mobile ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Exploiting unidirectional links for key establishment protocols in heterogeneous sensor networks
Computer Communications
Analysis of k-Neigh topology control protocol for mobile wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Feasibility of Motion Planning on Directed Graphs
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
On link asymmetry and one-way estimation in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Feasibility of motion planning on acyclic and strongly connected directed graphs
Discrete Applied Mathematics
Security-aware routing and localization for a directional mission critical network
IEEE Journal on Selected Areas in Communications
Wireless ad hoc networks: an overview
Network performance engineering
Journal of Parallel and Distributed Computing
A method of proactive MANET routing protocol evaluation applied to the OLSR protocol
WiNTECH '11 Proceedings of the 6th ACM international workshop on Wireless network testbeds, experimental evaluation and characterization
A new routing protocol in ad hoc networks with unidirectional links
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
A cluster-based multicast scheme with asymmetric link support in Mobile Ad hoc Networks
International Journal of Ad Hoc and Ubiquitous Computing
Improved approximation for orienting mixed graphs
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Efficient and resilient overlay topologies over ad hoc networks
IWSOS'07 Proceedings of the Second international conference on Self-Organizing Systems
Asymmetric Geographic Forwarding: Exploiting Link Asymmetry in Location Aware Routing
International Journal of Embedded and Real-Time Communication Systems
Computer Standards & Interfaces
An efficient hop count routing protocol for wireless ad hoc networks
International Journal of Automation and Computing
Hi-index | 0.00 |
We examine two aspects concerning the influence of unidirectional links on routing performance in multihop wireless networks. In the first part of the paper we evaluate the benefit from utilizing unidirectional links for routing as opposed to using only bidirectional links. Our evaluations are based on three transmit power assignment models that reflect some realistic network scenarios with unidirectional links. Our results indicate that the marginal benefit of using a high-overhead routing protocol to utilize unidirectional links is questionable.Most common routing protocols however simply assume that all network links are bidirectional and thus may need additional protocol actions to remove unidirectional links from route computations. In the second part of the paper we investigate this issue using a well known on-demand routing protocol Ad hoc On-demand Distance Vector (AODV) as a case study. We study the performance of three techniques for AODV for efficient operation in presence of unidirectional links viz. BlackListing Hello and ReversePathSearch. While BlackListing and Hello techniques explicitly eliminate unidirectional links the ReversePathSearch technique exploits the greater network connectivity offered by the existence of multiple paths between nodes. Performance results using ns-2 simulations under varying number of unidirectional links and node speeds show that all three techniques improve performance by avoiding unidirectional links the ReversePathSearch technique being the most effective.