probability based dynamic load-balancing tree algorithm for wireless     sensor networks

ISCAS OpenIR

	probability based dynamic load-balancing tree algorithm for wireless sensor networks
	Yan TX; Bi YZ; Sun LM; Zhu HS
	2005
会议名称	3rd International Conference on Computer Networks and Mobile Computing (ICCNMC 2005)
会议录名称	Lecture Notes in Computer Science
页码	682-691
会议日期	AUG 02-04,
会议地点	Zhangjiajie, PEOPLES R CHINA
收录类别	sci ; istp ; ei
出版地	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者	NETWORKING AND MOBILE COMPUTING, PROCEEDINGS
ISSN	0302-9743
ISBN	3-540-28102-9
部门归属	Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
摘要	Load balance can reduce hot spots, maintain network connectivity and prolong lifetime of wireless sensor networks. In large scale and randomly deployed wireless sensor networks, the energy consumption is sharply uneven among sensor nodes. We p
关键词	Algorithms Computer Simulation Telecommunication Traffic Trees (Mathematics) Wireless Telecommunication Systems
主办者	China Comp Federat, IEEE Comp Soc Beijing Chapter, Hunan Comp Soc, IEEE TC Distributed Proc
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/12740
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Yan TX,Bi YZ,Sun LM,et al. probability based dynamic load-balancing tree algorithm for wireless sensor networks[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:NETWORKING AND MOBILE COMPUTING, PROCEEDINGS,2005:682-691.