Efficient minimum spanning tree construction without Delaunay triangulation Pratyay Kuila , Prasanta K Jana , Ian F Akyildiz , Mehmet Can Vuran , Ian F Akyildiz , Su Weilian , Yogesh Sankarasubramaniam , Erdal Cayirci , Jennifer Yick , Biswanath Mukherjee , Dipak Ghosal , Giuseppe Anastasi , Marco Conti , Mario Di Francesco , Andrea Passarella , Emanuele Lattanzi , Edoardo Regini , Andrea Acquaviva , Alessandro Bogliolo , Benton H Calhoun , Denis C Daly , Naveen Verma , Daniel F Finchelstein , David D Wentzloff , Anantha P Chandrakasan , Yong-hong Zeng , Xue-cheng Zou , Zheng-lin Liu , Jian-ming Lei , Ahmad Abed Alhameed Alkhatib , Gurvinder Singh Baicher , M Aykut , Ilker Demirkol , Cem Ersoy , Fatih Alagoz , C Ricardo , Roja Chandanala , Wei Zhang , Radu Stoleru , Myounggyu Won , Maher Rebai , Matthieu Le Berre , Hichem Snoussi , Faicel Hnaien , Lyes Khoukhi , Shad Roundy , Gregory J Pottie , William J Kaiser , Crossbow micaz mote specifications , Wendi Beth Heinzelman , Wendi B Heinzelman , Anantha P Chandrakasan , Hari Balakrishnan , Isabel Dietrich , Falko Dressler , Ritesh Madan , Shuguang Cui , Sanjay Lall , Andrea Goldsmith , Mihaela Cardei , Du Ding-Zhu , J Pan , YT Hou , L Cai , Y Shi , SX Shen , Lilia Paradis , Qi Han , Marvin Rausand , Arnljot Høyland , Jae-Joon Lee , Bhaskar Krishnamachari , CC Jay Kuo , Pratyay Kuila , Prasanta K Jana , Pratyay Kuila , Prasanta K Jana , Pratyay Kuila , Gupta Suneet Kumar , Pratyay Kuila , Prasanta K Jana , Ataul Bari , Shamsul Wazed , Arunita Jaekel , Subir Bandyopadhyay , Ataul Bari , Arunita Jaekel , Subir Bandyopadhyay , Xiuzhen Cheng , Du Ding-Zhu , Lusheng Wang , Xu Baogang , Ataul Bari , Arunita Jaekel , Subir Bandyopadhyay , Jian Tang , Bin Hao , Arunabha Sen , Emil Falck , Patrik Floréen , Petteri Kaski , Jukka Kohonen , Pekka Orpo-nen , Gaurav Gupta , Mohamed Younis , Gaurav Gupta , Mohamed Younis , Habib M Ammari , Sajal K Das , Y Thomas Hou , Yi Shi , Jianping Pan , Scott F Midkiff , Milica Pejanovic′ Ðurišic′ , Zhilbert Tafa , Goran Dimic′ , Veljko Miluti-novic′ , Oladayo Bello , Sherali Zeadally , Mohammad Badra , CP Kruger , AM Abu-Mahfouz , GP Hancke , Wendi Rabiner Heinzelman , Amit Sinha , Alice Wang , Anantha P Chan-drakasan , Rex Min , Manish Bhardwaj , S Cho , Amit Sinha , Eugene Shih , Alice Wang , Anantha Chandrakasan , Alec Woo , David E Culler , Wei Ye , John Heidemann , Deborah Estrin , Eugene Shih , Seong-Hwan Cho , Nathan Ickes , Rex Min , Amit Sinha , Alice Wang , Anantha Chandrakasan , Kemal Akkaya , Mohamed Younis , Olutayo Boyinbode , Hanh Le Clustering and Routing Algorithms for Wireless Sensor Networks: Energy Efficient Approaches（2017）
摘要
In multi-hop communication, the sensor nodes that are closer to the BS inevitably perform data forwarding. As a result, the energy consumption of these sensor nodes is comparably higher than that of the other sensor nodes. This imbalanced energy consumption leads to the premature death of a certain number of nodes near to the BS, and causes the hot spot problem. One such situation is shown in Figure . There are many solutions to resolve this problem. Here, we present two methods, i.e., unequal clustering and use of a mobile sink.
更多 查看译文
AI 理解论文
溯源树
样例
