Open Science Research Excellence

Open Science Index

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


Select areas to restrict search in scientific publication database:
10004693
Efficient Broadcasting in Wireless Sensor Networks
Abstract:
In this paper, we study the Minimum Latency Broadcast Scheduling (MLBS) problem in wireless sensor networks (WSNs). The main issue of the MLBS problem is to compute schedules with the minimum number of timeslots such that a base station can broadcast data to all other sensor nodes with no collisions. Unlike existing works that utilize the traditional omni-directional WSNs, we target the directional WSNs where nodes can collaboratively determine and orientate their antenna directions. We first develop a 7-approximation algorithm, adopting directional WSNs. Our ratio is currently the best, to the best of our knowledge. We then validate the performance of the proposed algorithm through simulation.
Digital Object Identifier (DOI):

References:

[1] R. Gandhi, S. Parthasarathy, and A. Mishra, “Minimizing Broadcast Latency and Redundancy in Ad Hoc Networks,” in MobiHoc, 2003, pp. 222–232.
[2] R. Gandhi, A. Mishra, and S. Parthasarathy, “Minimizing Broadcast Latency and Redundancy in Ad Hoc Networks,” IEEE/ACM Trans. Netw., vol. 16, no. 4, pp. 840–851, 2008.
[3] A. Dessmark and A. Pelc, “Tradeoffs Between Knowledge and Time of Communication in Geometric Radio Networks,” in Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA). ACM, 2001, pp. 59–66.
[4] S. C.-H. Huang, P.-J. Wan, X. Jia, and H. Du, “Low-Latency Broadcast Scheduling in Ad Hoc Networks,” in WASA, 2006, pp. 527–538.
[5] S. C.-H. Huang, P.-J. Wan, X. Jia, H. Du, and W. Shang, “Minimum-Latency Broadcast Scheduling in Wireless Ad Hoc Networks,” in INFOCOM, 2007, pp. 733–739.
[6] M. K. An, N. X. Lam, D. T. Huynh, and T. N. Nguyen, “Minimum Latency Gossiping in Wireless Sensor Networks,” in Proceedings of the International Conference on Wireless Networks (ICWN), 2012, pp. 406–412.
[7] S. C. Huang, P. Wan, J. Deng, and Y. S. Han, “Broadcast Scheduling in Interference Environment,” IEEE Trans. Mob. Comput., vol. 7, no. 11, pp. 1338–1348, 2008.
[8] K. Krzywdzinski, “Fast Construction of Broadcast Scheduling and Gossiping in Dynamic Ad Hoc Networks,” in IMCSIT, 2010, pp. 879–884.
[9] R. Gandhi, Y.-A. Kim, S. Lee, J. Ryu, and P.-J. Wan, “Approximation Algorithms for Data Broadcast in Wireless Networks,” in INFOCOM, 2009, pp. 2681–2685.
[10] R. Gandhi, Y. Kim, S. Lee, J. Ryu, and P. Wan, “Approximation Algorithms for Data Broadcast in Wireless Networks,” IEEE Trans. Mob. Comput., vol. 11, no. 7, pp. 1237–1248, 2012.
[11] R. Ramanathan, “On the Performance of Ad Hoc Networks with Beamforming Antennas,” in MobiHoc, 2001, pp. 95 – 105.
[12] S. Roy, Y. C. Hu, D. Peroulis, and X.-Y. Li, “Minimum-Energy Broadcast Using Practical Directional Antennas in All-Wireless Networks,” in INFOCOM, 2006.
[13] M. K. An, N. X. Lam, D. T. Huynh, and T. N. Nguyen., “Minimum Latency Aggregation Scheduling in Interference-Aware 3-Dimensional WSNs,” in International Conference on Wireless Networks (ICWN), 2013.
[14] T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 3rd ed. The MIT Press, 2009.
[15] X. Li, X. Xu, S. Wang, S. Tang, G. Dai, J. Zhao, and Y. Qi, “Efficient Data Aggregation in Multi-hop Wireless Sensor Networks under Physical Interference Model,” in IEEE MASS, 2009, pp. 353–362.
[16] P. Wan, K. M. Alzoubi, and O. Frieder, “Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks,” in INFOCOM, 2002, pp. 1597 – 1604.
Vol: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