GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Trading structure for randomness in wireless opportunistic routing
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Surviving attacks on disruption-tolerant networks without authentication
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Security and Cooperation in Wireless Networks: Thwarting Malicious and Selfish Behavior in the Age of Ubiquitous Computing
A survey of routing attacks in mobile ad hoc networks
IEEE Wireless Communications
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Traditional MANET routing protocols are quite susceptible to link failure as well as vulnerable to malicious node attack. In this paper, we propose a novel protocol called Position based Opportunistic Routing (POR) which takes full advantage of the broadcast nature of wireless channel and opportunistic forwarding. The data packets are transmitted as a way of multicast (which is actually implemented by MAC interception) with multiple forwarders. A forwarder list determined by previous hop according to local position information is inserted into the IP header and the candidates take turn to forward the packet based on a predefined orders. This redundancy and randomness make it quite efficient and robust. In addition, inherited from position based routing, POR's control overhead is almost negligible which justifies its good scalability. Both theoretical analysis and simulation results show that POR not only achieves outstanding performances in normal situations but also yields excellent resilience in hostile environments.