Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29414


Select areas to restrict search in scientific publication database:
14305
Performance of a Connected Random Covered Energy Efficient Wireless Sensor Network
Abstract:
For the sensor network to operate successfully, the active nodes should maintain both sensing coverage and network connectivity. Furthermore, scheduling sleep intervals plays critical role for energy efficiency of wireless sensor networks. Traditional methods for sensor scheduling use either sensing coverage or network connectivity, but rarely both. In this paper, we use random scheduling for sensing coverage and then turn on extra sensor nodes, if necessary, for network connectivity. Simulation results have demonstrated that the number of extra nodes that is on with upper bound of around 9%, is small compared to the total number of deployed sensor nodes. Thus energy consumption for switching on extra sensor node is small.
Digital Object Identifier (DOI):

References:

[1] A. Cerpa and D. Estrin, "Ascent: Adaptive Self-Configuring Sensor Networks Topologies," Proc. IEEE INFOCOM 2002, June 2002.
[2] B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, "Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks," Proc. ACM/IEEE Int-l Conf. Mobile Computing and Networking (Mobicom 2001), pp. 85-96, July 2001.
[3] B. Warneke, M. Last, B. Leibowitz, and K. Pister, "Smart Cust: Communicating with a Cubic-Millimeter Computer," Ad Hoc Networks J., vol. 34, no. 1, pp. 44-51, Jan. 2001.
[4] C. Hsin and M. Liu, "Network Coverage Using Low Duty-Cycled Sensors: Random & Coordinated Sleep Algorithm," Proc. Third Int-l Symp. Information Processing in Sensor Networks (IPSN 2004), Apr. 2004.
[5] C. Liu, K. Wu, and V. King, "Randomized Coverage-Preserving Scheduling Schemes for Wireless Sensor Networks," Proc. IFIP Networking Conf. 2005, May 2005.
[6] C. Liu, K. Wu, Y. Xiao and B. Sun, "Random Coverage with Guaranteed Connectivity: Joint Scheduling for Wireless Sensor Networks," IEEE Transactions on parallel and distributed systems, vol. 17, no. 6, June 2006.
[7] C. Schurgers, V. Tsiatsis, S. Ganeriwal, and M. Strivastava, "Topology Management for Sensor Networks: Exploiting Latency and Density," Proc. ACM MobiHoc 2002, June 2002.
[8] D. Tian and D. Georganas, "A Coverage-Preserving Node Scheduling Scheme for Large Wireless Sensor Networks," Proc. ACM Workshop Wireless Sensor Networks and Applications, Oct. 2002.
[9] F. Ye, G. Zhong, J. Cheng, S. Lu, and L. Zhang, "Peas: A Robust Energy Conserving Protocol for Long-Lived Sensor Networks," Proc. 10th IEEE Int-l Conf. Network Protocols, Nov. 2002.
[10] K. Wu, Y. Gao, F. Li, and Y. Xiao, "Lightweight Deployment-Aware Scheduling for Wireless Sensor Networks," ACM/Springer Mobile Networks and Applications (MONET), special issue on energy constraints and lifetime performance in wireless sensor networks, vol. 10, no. 6, pp. 837-852, Dec. 2005.
[11] S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. Srivastava, "Coverage Problems in Wireless Ad-Hoc Sensor Neworks," Proc. IEEE Infocom 2001, Apr. 2001.
[12] S. Slijepcevic and M. Potkonjak, "Power Efficient Organization of Wireless Sensor Networks," Proc. IEEE Int-l Conf. Comm. 2001, June 2001.
[13] T. Yan, T. He, and J. Stankovic, "Differentiated Surveillance for Sensor Networks," Proc. First Int-l Conf. Embedded Networked Sensor Systems, Nov. 2003.
[14] Y. Xu, S. Bien, Y. Mori, J. Heidemann, and D. Estrin, "Topology Control Protocols to Conserve Energy in Wireless Ad Hoc Networks," CENS Technical Report 0006, Jan. 2003.
[15] Z. Abrams, A. Goel, and S. Plotkin, "Set k-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks," Proc. Third Int-l Symp. Information Processing in Sensor Networks (IPSN 2004), Apr. 2004.
Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007