Distributed Multi-hop Network Association in Large-Scale Wireless Sensor Networks

Distributed Computing Systems Workshops(2013)

引用 3|浏览1
暂无评分
摘要
In this paper, we consider the construction of a large scale wireless sensor network (WSN) by means of distributed network association with scalability. We design a network association mechanism that allows each router to have its own addressing space for unique addressing of its child nodes based on a pre-initialized addressing tree. We also design a device selection algorithm that can locate routers throughout the whole deployment area using a minimum number of routers (i.e., minimizing the energy consumption). Thus, nodes can securely join the network through a sufficient number of neighboring routers, with the use of a uniquely allocated address in a distributed manner. Finally, the performance of the proposed scheme is evaluated by computer simulation, showing remarkable performance improvement over conventional schemes when applied to the construction of a large scale WSN.
更多
查看译文
关键词
conventional scheme,network association mechanism,multi-hop network association,remarkable performance improvement,minimum number,neighboring routers,sensor network,network association,sufficient number,computer simulation,large scale,large-scale wireless sensor networks,routing,broadcasting,scalability,wireless sensor network,wireless sensor networks,resource management
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要