DIN: An ad-hoc algorithm to estimate distances in wireless sensor networks

被引:0
|
作者
Villafuerte, Freddy Lopez [1 ]
Schiller, Jochen [1 ]
机构
[1] Free Univ Berlin, Inst Informat, D-14195 Berlin, Germany
关键词
localization; neighborhood; network density;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A current challenge in wireless sensor networks is the positioning of sensor nodes for indoor environments without dedicated hardware. Especially in this domain, many applications rely on spatial information to relate collected data to the location of its origin. First of all, an estimation of the distance between two nodes is necessary to determine their positions. So far, the majority of approaches have explored physical properties of signals such as the strength of a received signal or its arrival time. However, this has been problematic since either the complexity on the software or on the hardware side is not adequate for embedded systems, or the approaches lack the required accuracy. In this paper we present the DIN algorithm (Distance by Intersection of Neighborhoods) to determine the distance between two nodes in an Ad-hoc manner, relying solely on the investigation of local node densities. To evaluate the accuracy of this algorithm, we conducted extensive simulations and experimented with different testbed setups using real sensor nodes. We were able to assure competitive values for the measured error.
引用
收藏
页码:162 / 175
页数:14
相关论文
共 50 条
  • [1] Robust sensor localization algorithm in wireless ad-hoc sensor networks
    Ji, X
    Zha, HY
    ICCCN 2003: 12TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, PROCEEDINGS, 2003, : 527 - 532
  • [2] Coverage in wireless ad-hoc sensor networks
    Li, XY
    Wan, PJ
    Frieder, O
    2002 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5, CONFERENCE PROCEEDINGS, 2002, : 3174 - 3178
  • [3] Selective anchor placement algorithm for ad-hoc wireless sensor networks
    Li, Xiaoli
    Shi, Hongchi
    Shang, Yi
    2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13, 2008, : 2359 - 2363
  • [4] Sensor Disposition Problem in Wireless Ad-Hoc Sensor Networks
    Yanaka, Takahide
    Sasama, Toshihiko
    Masuyama, Hiroshi
    ADVANCES IN INFORMATION SECURITY AND ASSURANCE, 2009, 5576 : 485 - 493
  • [5] A map-growing localization algorithm for ad-hoc wireless sensor networks
    Li, XL
    Shi, HC
    Shang, Y
    TENTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 2004, : 395 - 402
  • [6] Coverage problems in wireless ad-hoc sensor networks
    Meguerdichian, S
    Koushanfar, F
    Potkonjak, M
    Srivastava, MB
    IEEE INFOCOM 2001: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: TWENTY YEARS INTO THE COMMUNICATIONS ODYSSEY, 2001, : 1380 - 1387
  • [7] Processing ad-hoc queries in wireless sensor networks
    Yun, Sanghun
    Cho, Haengrae
    Liu, Xingcheng
    PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: NEW GENERATIONS, 2008, : 749 - +
  • [8] On communication security in wireless ad-hoc sensor networks
    Slijepcevic, S
    Potkonjak, M
    Tsiatsis, V
    Zimbeck, S
    Srivastava, MB
    WET ICE 2002: ELEVENTH IEEE INTERNATIONAL WORKSHOPS ON ENABLING TECHNOLOGIES: INFRASTRUCTURE FOR COLLABORATIVE ENTERPRISES, PROCEEDINGS, 2002, : 139 - 144
  • [9] Time Synchronization in Ad-Hoc Wireless Sensor Networks
    Sharma, Nishant
    PROCEEDING OF INTERNATIONAL CONFERENCE ON RECENT TRENDS IN APPLIED PHYSICS & MATERIAL SCIENCE (RAM 2013), 2013, 1536 : 1350 - 1351
  • [10] Scheduling algorithms for wireless ad-hoc sensor networks
    Florens, C
    McEliece, R
    GLOBECOM'02: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-3, CONFERENCE RECORDS: THE WORLD CONVERGES, 2002, : 6 - 10