• Corpus ID: 16794109

ES 2 Approach for Geographic Routing In Mobile Sensor Networks

  title={ES 2 Approach for Geographic Routing In Mobile Sensor Networks},
  author={P. S. Dhivya and Shahul Hammed},
Geographic routing is a promising routing scheme in wireless sensor networks (WSNs), is shifting toward duty-cycled WSNs in which sensors are sleep scheduled to reduce energy consumption. However, except the connected-k neighborhood (CKN) sleep scheduling algorithm and the geographic routing oriented sleep scheduling (GSS) algorithm, nearly all research work about geographic routing in duty-cycled WSNs has focused on the geographic forwarding mechanism; further, most of the existing work has… 

Figures from this paper


Energy-Efficient Beaconless Geographic Routing in Wireless Sensor Networks
Simulation results show that the EBGR scheme significantly outperforms existing protocols in wireless sensor networks with highly dynamic network topologies and extends to lossy sensor networks to provide energy-efficient routing in the presence of unreliable communication links.
A metric for routing in delay-sensitive wireless sensor networks
  • Zhen Jiang, Jie Wu, Risa Ito
  • Computer Science
    The 7th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS 2010)
  • 2010
A new scheme to reduce the end-to-end routing delay in the mission-critical applications of the wireless sensor networks (WSNs) under the duty cycle model and focuses on an “everyone” model, in which each node will apply the same generic process in a fully distributed manner in order to achieve a reliable solution.
Joint k-coverage, duty-cycling, and geographic forwarding in wireless sensor networks
Simulation results show that the joint protocol outperforms the resulting protocol, CCP+BVGF, and the design of a geographic forwarding protocol for duty-cycled k-covered WSNs with data aggregation is proposed.
Energy-Efficient Cross-Layer Protocol of Channel-Aware Geographic-Informed Forwarding in Wireless Sensor Networks
This paper shows the existence of the unique optimal relay node to maximize EAM over a typical Nakagami-m channel of a code-division multiple-access (CDMA)-based WSN and presents a cross-layer packet-forwarding protocol channel-aware geographic-informed forwarding (CAGIF) by optimally selecting the relay nodes.
GPSR: greedy perimeter stateless routing for wireless networks
Greedy Perimeter Stateless Routing is presented, a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions and its scalability on densely deployed wireless networks is demonstrated.
Towards optimal sleep scheduling in sensor networks for rare-event detection
A protocol for node sleep scheduling that guarantees a bounded-delay sensing coverage while maximizing network lifetime is proposed that is optimized for rare event detection and allows favorable compromises to be achieved between event detection delay and lifetime without sacrificing (eventual) coverage.
Geographic Routing Without Planarization
A new geographic routing algorithm, Greedy Distributed Spanning Tree Routing (GDSTR), that finds shorter routes and generates less maintenance traffic than previous algorithms, and requires an order of magnitude less bandwidth to maintain its trees than CLDP.
Human-following mobile robot in a distributed intelligent sensor network
The control law based on the virtual spring model is proposed to mitigate the difference of movement between the human and the mobile robot and it is verified by the computer simulation and the experiment.
Send probe packet p u to neighbors and receive the ack packet
  • Send probe packet p u to neighbors and receive the ack packet
Energy-efficient data gather-ing with tour length-constrained mobile elements in wireless sensor networks
  • IEEE Trans. Parallel & Distributed Systems
  • 2010