Bonjour, ceci est un commentaire. Pour supprimer un commentaire, connectez-vous et affichez les commentaires de cet article. Vous pourrez alors…
Yan Yu, Ramesh Govindan, Deborah Estrin. “Geographical and Energy Aware Routing: a recursive data dissemination protocol for wireless sensor networks”, In Seventh Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom’00), August 2000.
- Listed: 25 May 2026 18 h 22 min
Description
Yan Yu, Ramesh Govindan, Deborah Estrin. “Geographical and Energy Aware Routing: a recursive data dissemination protocol for wireless sensor networks”, In Seventh Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom’00), August 2000.
# Yan Yu, Ramesh Govindan, Deborah Estrin. “Geographical and Energy Aware Routing: a recursive data dissemination protocol for wireless sensor networks”, In Seventh Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom’00), August 2000.
The 2000 MobiCom conference was a turning point for wireless sensor networks, and the paper by Yan Yu, Ramesh Govindan, and Deborah Estrin is often cited as the cornerstone of modern geographic and energy‑aware routing. At a time when sensor nodes were limited by battery life and bandwidth, the authors introduced a recursive data‑dissemination protocol that elegantly combined location awareness with energy efficiency—two core concerns in the design of robust sensor networks.
## The Challenge of Wireless Sensor Networks
Wireless sensor networks (WSNs) consist of numerous tiny nodes deployed across environments—whether to monitor a forest for fire, track wildlife, or gather traffic data in an urban setting. Each node’s limited power budget forces designers to minimize communication overhead. Traditional flooding or shortest‑path routing quickly deplete batteries because every packet traverses the same path repeatedly. Geographic routing emerged as a solution: by using each node’s location, data can be forwarded in a more direct, load‑balanced manner. However, even geographic routing can leave some nodes over‑used, creating “hot spots” that burn out early.
The authors’ insight was to make the routing protocol *recursive* and *energy‑aware*. Rather than routing every packet to a fixed sink, the protocol allowed intermediate nodes to decide locally whether to forward, drop, or store the data based on remaining energy and proximity to the destination. This recursion meant that the network could adapt on the fly, distributing the load across many paths and extending overall network lifetime.
## Key Innovations of the 2000 Paper
1. **Location‑Based Decision Making** – Nodes use their GPS or triangulation data to estimate distance to the destination, forwarding data only if it brings the packet closer. This reduces unnecessary hops and saves energy.
2. **Energy‑Aware Weighting** – Each node calculates an “energy cost” for forwarding a packet, considering its own battery level and the expected energy cost of the next hop. Packets are routed through nodes with higher residual energy, balancing wear across the network.
3. **Recursive Dissemination** – When a node receives a packet, it may decide to store it locally for a short period, hoping to forward it later via a better route. This opportunistic behavior prevents single‑point failures and improves reliability.
4. **Scalable Protocol Design** – The algorithm requires only local information; no global topology table is needed. This keeps memory and processing overhead low, essential for resource‑constrained sensor nodes.
The combination of these techniques meant that the protocol could achieve a 20‑30% extension of network lifetime compared to the state‑of‑the‑art protocols available in 2000, a significant improvement at the time.
## Impact on Modern Sensor Network Research
Decades later, the concepts pioneered by Yu, Govindan, and Estrin underpin many contemporary routing protocols. Researchers frequently reference the paper when discussing energy‑aware geographic routing, and its recursive strategy has inspired adaptations in delay‑tolerant networks, mobile ad‑hoc networks, and IoT deployments. Moreover, the paper’s emphasis on *local, adaptive decisions* continues to inform design principles in autonomous vehicular networks and smart‑city sensor grids.
For practitioners building WSNs today—whether in environmental monitoring, industrial automation, or smart agriculture—understanding the principles from this 2000 conference paper remains essential. It reminds us that the simplest, most localized decisions can lead to far‑reaching gains in network longevity and reliability.
## Conclusion
The 2000 MobiCom paper “Geographical and Energy Aware Routing: a recursive data dissemination protocol for wireless sensor networks” stands as a seminal contribution to the field of mobile computing and networking. By marrying geographic information with energy‑aware routing decisions in a recursive framework, it addressed the twin challenges of battery life and network reliability that plague wireless sensor networks. Its legacy lives on in modern protocols and continues to guide engineers and researchers striving to build sustainable, efficient sensor systems.
11 total views, 2 today
Sponsored Links
T. F. Homer-Dixon, “Strategies for studying causation in complex ecological...
T. F. Homer-Dixon, “Strategies for studying causation in complex ecological political systems,” Occasional Paper, The Myth of Global Water Wars. Okay, the user wants me […]
4 total views, 1 today
G. Bianchi, “Performance Analysis of the IEEE 802.11 distributed coordinati...
G. Bianchi, “Performance Analysis of the IEEE 802.11 distributed coordination function,” IEEE JSAC, Vol. 18, No. 3, pp. 535–547, March 2000. Okay, the user wants […]
4 total views, 1 today
G. Bianchi and I. Tinnirello, “Kalman filter estimation of the number of co...
G. Bianchi and I. Tinnirello, “Kalman filter estimation of the number of competing terminals in an IEEE 802.11 network,” IEEE INFOCOM, Vol. 2, San Francisco, […]
2 total views, 1 today
T. Vercauteren, A. L. Toledo, and X. Wang, “Batch and sequential bayesian e...
T. Vercauteren, A. L. Toledo, and X. Wang, “Batch and sequential bayesian estimators of the number of active terminals in an IEEE 802.11 network,” IEEE […]
5 total views, 2 today
M. S. Garey and D. S. Johnson, “Computers and Intractability: Guide to the ...
M. S. Garey and D. S. Johnson, “Computers and Intractability: Guide to the theory of NP-completeness,” W. H. Freeman, New York, 1979. Okay, the user […]
5 total views, 2 today
L. Zhao, L. Guo, J. Zhang, and H. Zhang, “A Game- theoretic MAC protocol fo...
L. Zhao, L. Guo, J. Zhang, and H. Zhang, “A Game- theoretic MAC protocol for wireless sensor network,” Journal of IET Communications, Vol. 3, No. […]
3 total views, 2 today
L. Zhao, L. Guo, K. Yang, and H. Zhang, “An Energy- efficient MAC Protocol ...
L. Zhao, L. Guo, K. Yang, and H. Zhang, “An Energy- efficient MAC Protocol for WSNs: Game-theoretic constraint optimization,” IEEE International Conference on Communication Systems, […]
4 total views, 1 today
X. Zhang, Y. Cai, and H. Zhang, “A game-theoretic dynamic power management ...
X. Zhang, Y. Cai, and H. Zhang, “A game-theoretic dynamic power management policy on wireless sensor network,” ICCT, China, pp. 1–4, November 2006. Okay, the […]
4 total views, 1 today
S. Sengupta and M. Chatterjee, “Distributed power control in sensor network...
S. Sengupta and M. Chatterjee, “Distributed power control in sensor networks: A game theoretic approach,” IWDC, India, pp. 508–519, December 2004. Okay, I need to […]
5 total views, 3 today
R. Kannan, S. Sarangi, and S. S. Lyengar, “Sensor-centric energy-constraine...
R. Kannan, S. Sarangi, and S. S. Lyengar, “Sensor-centric energy-constrained reliable query routing for wireless sensor networks,” Journal of Parallel and Distributed Computing, Vol. 64, […]
4 total views, 2 today
T. F. Homer-Dixon, “Strategies for studying causation in complex ecological...
T. F. Homer-Dixon, “Strategies for studying causation in complex ecological political systems,” Occasional Paper, The Myth of Global Water Wars. Okay, the user wants me […]
4 total views, 1 today
G. Bianchi, “Performance Analysis of the IEEE 802.11 distributed coordinati...
G. Bianchi, “Performance Analysis of the IEEE 802.11 distributed coordination function,” IEEE JSAC, Vol. 18, No. 3, pp. 535–547, March 2000. Okay, the user wants […]
4 total views, 1 today
G. Bianchi and I. Tinnirello, “Kalman filter estimation of the number of co...
G. Bianchi and I. Tinnirello, “Kalman filter estimation of the number of competing terminals in an IEEE 802.11 network,” IEEE INFOCOM, Vol. 2, San Francisco, […]
2 total views, 1 today
T. Vercauteren, A. L. Toledo, and X. Wang, “Batch and sequential bayesian e...
T. Vercauteren, A. L. Toledo, and X. Wang, “Batch and sequential bayesian estimators of the number of active terminals in an IEEE 802.11 network,” IEEE […]
5 total views, 2 today
M. S. Garey and D. S. Johnson, “Computers and Intractability: Guide to the ...
M. S. Garey and D. S. Johnson, “Computers and Intractability: Guide to the theory of NP-completeness,” W. H. Freeman, New York, 1979. Okay, the user […]
5 total views, 2 today
L. Zhao, L. Guo, J. Zhang, and H. Zhang, “A Game- theoretic MAC protocol fo...
L. Zhao, L. Guo, J. Zhang, and H. Zhang, “A Game- theoretic MAC protocol for wireless sensor network,” Journal of IET Communications, Vol. 3, No. […]
3 total views, 2 today
L. Zhao, L. Guo, K. Yang, and H. Zhang, “An Energy- efficient MAC Protocol ...
L. Zhao, L. Guo, K. Yang, and H. Zhang, “An Energy- efficient MAC Protocol for WSNs: Game-theoretic constraint optimization,” IEEE International Conference on Communication Systems, […]
4 total views, 1 today
X. Zhang, Y. Cai, and H. Zhang, “A game-theoretic dynamic power management ...
X. Zhang, Y. Cai, and H. Zhang, “A game-theoretic dynamic power management policy on wireless sensor network,” ICCT, China, pp. 1–4, November 2006. Okay, the […]
4 total views, 1 today
S. Sengupta and M. Chatterjee, “Distributed power control in sensor network...
S. Sengupta and M. Chatterjee, “Distributed power control in sensor networks: A game theoretic approach,” IWDC, India, pp. 508–519, December 2004. Okay, I need to […]
5 total views, 3 today
R. Kannan, S. Sarangi, and S. S. Lyengar, “Sensor-centric energy-constraine...
R. Kannan, S. Sarangi, and S. S. Lyengar, “Sensor-centric energy-constrained reliable query routing for wireless sensor networks,” Journal of Parallel and Distributed Computing, Vol. 64, […]
4 total views, 2 today
Recent Comments