Pub Date : 2005-04-30DOI: 10.1109/EMNETS.2005.1469108
J. Rao, S. Biswas
This paper presents a mechanism for extending network life by introducing energy-aware mobility in wireless sensor networks. The concept of mobility for energy saving has been motivated by a natural grouping behavior that is observed in Emperor penguin communities in the Antarctic region. In this paper, we first draw a parallel between the heat loss of a penguin at the group periphery, and the routing energy burden of a sensor node near base stations. Then we develop a distributed mobility algorithm that works based on local energy information and makes sure that the energy load across sensor nodes in a network are evenly distributed for collective extension of the network life. We evaluate the protocol, and compare it with the performance upper bound derived from a centralized version of the algorithm. The results demonstrate that using the distributed algorithm for controlled node mobility it is possible to significantly extend the network life. It is also shown that this holds in situations where the energy cost of physical node mobility is modeled up to four orders of magnitude larger than the energy cost for packet communication.
{"title":"Biologically inspired mobility models for energy conservation in sensor networks","authors":"J. Rao, S. Biswas","doi":"10.1109/EMNETS.2005.1469108","DOIUrl":"https://doi.org/10.1109/EMNETS.2005.1469108","url":null,"abstract":"This paper presents a mechanism for extending network life by introducing energy-aware mobility in wireless sensor networks. The concept of mobility for energy saving has been motivated by a natural grouping behavior that is observed in Emperor penguin communities in the Antarctic region. In this paper, we first draw a parallel between the heat loss of a penguin at the group periphery, and the routing energy burden of a sensor node near base stations. Then we develop a distributed mobility algorithm that works based on local energy information and makes sure that the energy load across sensor nodes in a network are evenly distributed for collective extension of the network life. We evaluate the protocol, and compare it with the performance upper bound derived from a centralized version of the algorithm. The results demonstrate that using the distributed algorithm for controlled node mobility it is possible to significantly extend the network life. It is also shown that this holds in situations where the energy cost of physical node mobility is modeled up to four orders of magnitude larger than the energy cost for packet communication.","PeriodicalId":371563,"journal":{"name":"The Second IEEE Workshop on Embedded Networked Sensors, 2005. EmNetS-II.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123997290","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2005-04-30DOI: 10.1109/EMNETS.2005.1469102
Leo Szumel, Jason LeBrun, John D. Owens
Sensor networks of the future will continue to be characterized by extreme energy and bandwidth constraints, yet they will need to support a robust and dynamic programming environment. To support multiple applications which may change over the lifetime of the network, the programming system should allow for the deployment of new code in an efficient and on-demand fashion. Existing programming frameworks focus on providing an efficient means for reprogramming an entire network: we believe that self-directed propagation can be more efficient for applications that do not require (or would not benefit from) network-wide deployment of new code. We present and analyze a framework enabling autonomous programs (agents) capable of propagating themselves through a sensor network.
{"title":"Towards a mobile agent framework for sensor networks","authors":"Leo Szumel, Jason LeBrun, John D. Owens","doi":"10.1109/EMNETS.2005.1469102","DOIUrl":"https://doi.org/10.1109/EMNETS.2005.1469102","url":null,"abstract":"Sensor networks of the future will continue to be characterized by extreme energy and bandwidth constraints, yet they will need to support a robust and dynamic programming environment. To support multiple applications which may change over the lifetime of the network, the programming system should allow for the deployment of new code in an efficient and on-demand fashion. Existing programming frameworks focus on providing an efficient means for reprogramming an entire network: we believe that self-directed propagation can be more efficient for applications that do not require (or would not benefit from) network-wide deployment of new code. We present and analyze a framework enabling autonomous programs (agents) capable of propagating themselves through a sensor network.","PeriodicalId":371563,"journal":{"name":"The Second IEEE Workshop on Embedded Networked Sensors, 2005. EmNetS-II.","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133278410","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：