期刊文献+

A contention-based efficient-information perception algorithm (CEiPA) for vehicular ad hoc networks

A contention-based efficient-information perception algorithm (CEiPA) for vehicular ad hoc networks
下载PDF
导出
摘要 The problem of information dissemination is researched for vehicular ad-hoc networks(VANET)inthis paper,and a contention-based efficient-information perception algorithm(CEiPA)is proposed.Theidea of CEiPA is that beacons are delivered over VANET with limited lifetime and efficient information.CEiPA consists of two phases.The first one is initialization phase,during which the count timers T_(cycle)and T_(local)are set to start beacon delivery while T_(cycle)is also used to monitor and restart beaconing.Thesecond one is beacon delivery phase.An elaborate distance function is employed to set contention delayfor beacons of each vehicle.In this way beacons will be sent in order,which decreases the collision ofbeacons.Simulation results show that CEiPA enables each beacon to carry more efficient information andspread them over more vehicles with lower network overhead than the periodic beacon scheme.CEiPA isalso flexible and scalable because the efficient information threshold it employs is a balance among thefreshness of information,network overhead and perception area of a vehicle. The problem of information dissemination is researched for vehicular ad-hoc networks (VANET) in this paper, and a contention-based effficient-information perception algorithm (CEiPA) is proposed. The idea of CEiPA is that beacons are delivered over VANET with limited lifetime and efficient information. CEiPA consists of two phases. The first one is initialization phase, during which the count timers Tcyce and Tlocal are set to start beacon delivery while Tcycle is also used to monitor and restart beaconing. The second one is beacon delivery phase. An elaborate distance function is employed to set contention delay for beacons of each vehicle. In this way beacons will be sent in order, which decreases the collision of beacons. Simulation results show that CEiPA enables each beacon to carry more efficient information and spread them over more vehicles with lower network overhead than the periodic beacon scheme. CEiPA is also flexible and scalable because the efficient information threshold it employs is a balance among the freshness of information, network overhead and perception area of a vehicle.
作者 陈立家
出处 《High Technology Letters》 EI CAS 2009年第1期51-58,共8页 高技术通讯(英文版)
基金 Supported by the National Natural Science Foundation of China (No. 60502028) the Youth Chenguang Project of Science and Technology of Wuhan City of China (No. 200750731252) the Natural Science Foundation of Hubei Province of China (No. 2007ABA324)
关键词 信息感知 网络开销 车辆 算法 基础 AD 信息传播 距离函数 beacon, contention, efficient information, perception, vehicular ad hoc networks
  • 相关文献

参考文献12

  • 1任彦,张思东,张宏科.无线传感器网络三维空间最佳覆盖路由协议[J].电子学报,2006,34(2):306-311. 被引量:14
  • 2Benjie Chen,Kyle Jamieson,Hari Balakrishnan,Robert Morris.Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks[J].Wireless Networks.2002(5)
  • 3Ha J,,Kwon W H,Kim J J, et al.Feasibility analysis and implementation of the IEEE 802. 15. 4 multi-hop beacon-enabled network[].Proceedings of the th Joint Conference on Communications & Information.2005
  • 4Tschopp D,Diggavi S,Grossglauser M, et al.Robust georouting on embeddings of dynamic wireless networks[].Proceedings of IEEE INFOCOM.2007
  • 5Ergen M,Puri A.MEWIANA-mobile IP enriched wireless local area network architecture[].Proceedings of the th IEEE Vehicular Technology Fall Conference ( VTC ).2002
  • 6Liu J.Performance comparison of a beacon-aided source routing protocol to on-demand source-initiated routing protocols[].Proceedings of Wireless And Mobile Computing Networking And Communications.2005
  • 7Liu J.Peer-Tree: a peer-to-peer message forwarding structure for relaying messages in mobile applications[].Proceedings of the nd International Workshop on Hot Topics in Peer-to-Peer Systems.2005
  • 8Fonseca R,Ratnasamy S,Culler D, et al.Beacon vector routing: scalable point-to-point in wireless sensornets[].Proceedings of the nd Symposium on Networked Systems Design and Implementation (NSDI‘ OS).2005
  • 9Wang C Y,Wu C J,Chen G N, et al.p-MANET: efficient power saving protocol for multi-hop mobile ad hoc networks[].Proceedings of the rd International Conference on Information Technology and Applications ( ICITA‘ ).2005
  • 10Cooper B.Using information retrieval techniques to route queries in an infoBeacons network[].Proceedings of Database Information System and Peer-to-Peer Computing: nd International Workshop DBISPP.2004

二级参考文献23

  • 1I F Akyildiz,et al.Wireless sensor networks:a survey[J].Computer Networks,2002,38(4):393-422.
  • 2K Chakrabarty,et al.Grid coverage for surveillance and target location in distributed sensor networks[J].IEEE Trans Computers,2002,51(12):1448-1453.
  • 3F Y S Lin,P L Chiu.A near-optimal sensor placement algorithm to achieve complete coverage/discrimination in sensor networks[J].IEEE Communications Letters,2005,9(1):43-45.
  • 4S Megerian,F Koushanfar,M Potkonjak,et al.Worst and best-case coverage in sensor networks[J].IEEE Transactions on Mobile Computing,2005,4(1):84-92.
  • 5S Meguerdichian,F Koushanfar,M Potkonjak,et al.Coverage problems in wireless ad-hoc sensor network[A].In Proc IEEE INFOCOM′01[C].New York:IEEE Press,2001.1380-1387.
  • 6J Cortes,S Martinez,T Karatas,et al.Coverage control for mobile sensing networks[J].IEEE Transactions on Robotics and Automation,2004,20(2):243-255.
  • 7V Ravelomanana.Extremal properties of three-dimensional sensor networks with applications[J].IEEE Transactions on Mobile Computing,2004,3(3):246-257.
  • 8C F Huang,Y C Tseng,L C Lo.The coverage problem in three-dimensional wireless sensor networks[A].In Proc.IEEE GLOBECOM′04[C].New York:IEEE Press,2004.3182-3186.
  • 9V Chvatal.A combinatorial theorem in plane geometry[J].Journal of Combinatorial Theory Ser B,1975,18(1):39-41.
  • 10S Fisk.A short proof of chvatal′s watchman theorem[J].Journal of Combinatorial Theory Ser B,1978,24(3):374.

共引文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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