论文信息 - A Comparison of the Efficiencies of Different Wireless Sensor Network Algorithms with Respect to Time

A Comparison of the Efficiencies of Different Wireless Sensor Network Algorithms with Respect to Time

In this paper we discuss different wireless routing algorithms. We compare the efficiency of those routing algorithms. The basic criterion for the comparison is to determine the time to reach a message from source to destination. In this paper we have also shown that the most efficient WSN routing algorithm may not perform best in case of every application. Different routing algorithms are suitable for different application areas. We also discuss about the limitations of WSN.

Sarmistha Neogy | Sarbani Roy | Nandini Mukherjee | Subrata Dutta

[1] Miodrag Potkonjak,et al. Exposure in wireless Ad-Hoc sensor networks , 2001, MobiCom '01.

[2] Edward J. Coyle,et al. An energy efficient hierarchical clustering algorithm for wireless sensor networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[3] Edward J. Coyle,et al. Minimizing communication costs in hierarchically-clustered networks of wireless sensors , 2004, Comput. Networks.

[4] Deborah Estrin,et al. Directed diffusion for wireless sensor networking , 2003, TNET.

[5] Wendi B. Heinzelman,et al. Negotiation-Based Protocols for Disseminating Information in Wireless Sensor Networks , 2002, Wirel. Networks.

[6] Ying-Hong Wang,et al. Mobile Sink Routing Protocol with Registering in Cluster-Based Wireless Sensor Networks , 2008, UIC.