Routing and localization services in self-organizing wireless ad-hoc and sensor networks using virtual coordinates

被引:0
|
作者
Monti, Gianluca Moro Gabriele [1 ]
Ouksel, Aris M. [2 ]
机构
[1] Univ Bologna, Dept Elect Comp Sci & Syst, Viale Venezia 52, I-47023 Cesena, Italy
[2] Univ Illinois, Dept Informat & Decis Sci, Chicago, IL USA
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Large scale wireless ad-hoc networks of computers, sensors, PDAs etc. (i.e. nodes) are revolutionizing connectivity and leading to a paradigm shift from centralized systems to highly distributed systems. A plethora of routing algorithms have been proposed to support path discovery into this class of networks, ranging from broadcasting/flooding approaches to global positioning systems (GPS). W-Grid is a novel infrastructure whose selforganizing routing and localization Services enable message routing and data management without reliance on flooding/broadcasting operations or GPS. The resulting ad-hoc network does not suffer from the dead-end problem, which occurs in geographic-based routing when a node is unable to locate a neighbor closer to the destination than itself. As an example of data management we present a location service that allows a device to send messages to any another node without knowing its position. Extensive performance analysis and experiments have been conducted, and the results compared to GPSR, which is considered to be the most efficient solution not using broadcast operations but exploiting nodes' position. Analysis show that the difference between the performance of our approach and GPSR is minimal and therefore very interesting, since no GPS is used.
引用
收藏
页码:243 / +
页数:2
相关论文
共 50 条
  • [1] Towards a Self-organizing Stochastic-Communications Paradigm for Wireless Ad-hoc/Sensor Networks
    Ayyorgun, Sami
    Ai, Jing
    Shankar, Sonu
    [J]. 2008 FIFTH IEEE INTERNATIONAL CONFERENCE ON MOBILE AD-HOC AND SENSOR SYSTEMS, VOLS 1 AND 2, 2008, : 36 - 47
  • [2] A self-organizing heuristic for building optimal heterogeneous ad-hoc sensor networks
    Ranganathan, Prasanna
    Ranganathan, Aravind
    Minai, Ali
    Berman, Kenneth
    [J]. PROCEEDINGS OF THE 2006 IEEE INTERNATIONAL CONFERENCE ON NETWORKING, SENSING AND CONTROL, 2006, : 774 - 779
  • [3] SQUIRREL: Self-Organizing Qos-roUting for IntRa-flow Contention in Ad-Hoc wiRELess Networks
    Derhab, Abdelouahid
    [J]. SELF-ORGANIZING SYSTEMS, PROCEEDINGS, 2008, 5343 : 269 - 274
  • [4] Localization of Wireless Sensor Networks Using Self-Organizing Maps
    Chen, Xiaohui
    Zhang, Mengjiao
    Ruan, Kai
    Gong, Canfeng
    Min, Jiangbo
    [J]. 2013 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND MANAGEMENT SCIENCE (ICIEMS 2013), 2013, : 1091 - 1096
  • [5] NEURAL: A self-organizing routing algorithm for ad hoc networks
    Mujica, VE
    Sisalem, D
    Popescu-Zeletin, R
    [J]. PROCEEDINGS OF THE THIRD INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC, AND WIRELESS NETWORKS, 2005, : 259 - 266
  • [6] A self-organizing routing algorithm for wireless sensor networks
    Yao, Fang
    Yang, Shuang-Hua
    [J]. 2006 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-6, PROCEEDINGS, 2006, : 3388 - +
  • [7] ASO-TDMA: ad-hoc self-organizing TDMA protocol for shipborne ad-hoc networks
    Changho Yun
    Yong-kon Lim
    [J]. EURASIP Journal on Wireless Communications and Networking, 2012
  • [8] ASO-TDMA: ad-hoc self-organizing TDMA protocol for shipborne ad-hoc networks
    Yun, Changho
    Lim, Yong-kon
    [J]. EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2012, : 1 - 13
  • [9] Ad-hoc routing using virtual coordinates based on rooted trees
    Ben-Asher, Yosi
    Feldman, Moran
    Feldman, Sharoni
    [J]. IEEE INTERNATIONAL CONFERENCE ON SENSOR NETWORKS, UBIQUITOUS, AND TRUSTWORTHY COMPUTING, VOL 1, PROCEEDINGS, 2006, : 6 - +
  • [10] Robust sensor localization algorithm in wireless ad-hoc sensor networks
    Ji, X
    Zha, HY
    [J]. ICCCN 2003: 12TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, PROCEEDINGS, 2003, : 527 - 532