期刊文献+

一种面向目标跟踪应用的传感器网络路由协议 被引量:2

A Routing Protocol for Object Tracking in Sensor Networks
下载PDF
导出
摘要 移动目标跟踪应用在能量效率、可靠性、实时性和可扩展性等方面对传感器网络路由协议提出了较高要求。提出了一种基于目标跟踪应用的路由协议GGSR(Geographical Greedy and Stateless Routing,GGSR)。GGSR协议由两部分算法组成:sink节点到移动目标区域的查询数据包路由协议和目标区域到sink节点的汇聚数据包路由协议。GGSR是一种完全分布式的按需路由协议,动态建立和路径维护。节点只需要维护自身状态信息,具有较好的可扩展性。协议采取基于地理信息的贪婪转发策略,通过减少通信跳数,缩短了数据包路由的时延。协议以节点能量和距离的综合函数作为转发代价,同时考虑节点不同状态下的能耗,对不活动的节点及时休眠,使得协议具有较高的能量效率。协议采取下游节点转发确认机制提高了协议的可靠性。仿真实验表明,算法能够满足目标跟踪应用对传感器网络路由协议的性能要求。 Tracking mobile objects in sensor networks requires better performances including energy, reliability, real time and extensibility of routing protocol. A protocol named GGSR (Geographical Greedy and Stateless Routing) is presented in this paper. GGSR is a full distributed and on-demand protocol. Nodes need only mtormanon about themselves, this enhances its extensibility. A greedy forwarding decision based on geographical information of the sink node is employed to reduce the communication hops, which results in reducing the end-to-end delay between a object node and the sink node. GGSR takes an integrated function of the energy and the Euclidean distance as an election cost for the next forwarding node, and also takes various status of a node into count; these ensure the proposed protocol is energy efficient. An acknowledgement mechanism is employed to enhance reliability of GGSR. Simulation results show GGSR exhibits better performances.
出处 《传感技术学报》 CAS CSCD 北大核心 2008年第10期1744-1749,共6页 Chinese Journal of Sensors and Actuators
基金 国家863计划项目资助(2007AA01Z309) 湖北省自然科学基金资助项目(2007ABA299)
关键词 传感器网络 路由协议 目标跟踪 wireless sensor networks routing object tracking
  • 相关文献

参考文献6

  • 1唐勇,周明天,张欣.无线传感器网络路由协议研究进展[J].软件学报,2006,17(3):410-421. 被引量:201
  • 2Ko K, Vaidya N. Location-Aided Routing (LAR) in Mobile Ad Hoc Network[J]. Wireless Networks,2000,6(4):307-321.
  • 3Yu Y, Estrin D, Govindan R. Geographical and Energy-Aware Routing: A Recursive Data Dissemination Protocol for Wireless Sensor Networks[R]. UCLA Computer Science Department Technical Report, UCLA-CSD TR-01-0023, 2001.
  • 4Karp B, Kung H T. GPSR:Greedy perimeter stateless routing for wireless networks[C]//Proceeding of the 6th annual international conference on Mobile computing and networking, New York:ACM Press, 2000,243-254.
  • 5Kevin Fall. The ns Manual[EB/OL]. http://www, isi. edu/ nsnam/ns/ns-doeumentation, December, 2003.
  • 6Heinzelman W R, Chandrakasan A P, Balakrishnan H. Energy-Efficient communication protocol for wireless microsensor networks[C]. Proceeding of the Hawaii International Confer ence on System Sciences (HICSS '00), Hawaii, 2000. 2000: 3005 3014.

二级参考文献1

共引文献200

同被引文献22

  • 1Garcia P J, Duato J, Flich J, et al. Cost-Effective Congestionmanagement for Interconnection Networks Using Distributed Deterministic Routing [ C ]//IEEE, International Conference on, Parallel and Distributed Systems,Univ of Castilla-La Mancha,Albacete, Spain, Dec 2010:355-364.
  • 2Biswas S, Morris R. Opportunistic Routing in Multi-Hop Wireless Networks [ J ]. In ACM SIGCOMM Computer ommunications Review,Jan 2004,34( 1 ) :69-74.
  • 3Biswas S, Morris R. ExOR: Opportunistic Multi-Hop Routing for Wireless Networks [ J ]. ACM SIGCOMM Computer Communication Review, Aug 2005,35 (4) : 133-144.
  • 4Koetter R,M'edard M. An Mgebraic Approach to Network Coding[J].IEEE/ACM Transactionson on Networking,2003,11 (5) :782-795.
  • 5Rozner E, Seshadri J, Mehta Y, et al. Simple Opportunistic Routing Protocol for Wireless Mesh Networks[ C ]//Proc IEEE Workshop on, Wireless Mesh Networks,Univ of Texas,Austin,Sept 2006:48-54.
  • 6Rozner E, Seshadri J, Mebta Y, et al. SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks [ J ]. In IEEE Transactions on Mobile Computing, Dec 2009,8 (12) : 1622-1635.
  • 7Jaggi S, Sanders P, Chou P A, et al. Polynomial Time Algorithms for Multicast Network Code Construction [ J ]. IEEE Transaction on Information Theory,2005,51 ( 6 ) : 1973-1982.
  • 8Li S Y, Yeung R W, Cai N. Linear Network Coding [ J ]. IEEE Transactions on Information Theory,2003,49 ( 2 ) : 371 -381.
  • 9Ahlswede R,Cai N,Yeung R W,et al. Network Information Flow [ J ]. IEEE Transactions on Information Theory,20(lO,46(4) :1204-1216.
  • 10Chachulski S, Jennings M, Katti S, et al. Trading Structure for Ran- domness in Wireless Opportunistic Routing [ J ]. ACM SIGCOMM Computer Communication Review,2007,37 (4) : 169-180.

引证文献2

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部