Structured communication in single hop sensor networks

被引:0
|
作者
Bakshi, A [1 ]
Prasanna, VK [1 ]
机构
[1] Univ So Calif, Dept Elect Engn Syst, Los Angeles, CA 90089 USA
来源
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We propose a model for communication in single-hop wireless sensor networks and define and evaluate the performance of a robust, energy balanced protocol for a powerful and general routing primitive (N, p, k(1), k(2)) routing. This routing primitive represents the transfer of N packets among p nodes, where each node transmits at most k(1) packets and receives at most k(2) packets. Permutation routing is an instance of this primitive and has been recently studied by other researchers in the context of single-hop wireless radio networks. Our proposed protocol is the first to exploit the availability of a low-power control channel in addition to the "regular" data channel to achieve robustness in terms of handling node and link failures - both permanent and transient. We use a dynamic, distributed TDMA scheme for coordination over the control channel, which leads to collision-free transmissions over the data channel. The objective is to minimize overall latency, reduce per-node and overall energy consumption, and maintain energy balance. Our protocol is robust because the coordination is decentralized, there is no single point of failure, and one node failure affects only the packets destined for (and transmitted from) that particular node. Simulation results for different scenarios are presented.
引用
收藏
页码:138 / 153
页数:16
相关论文
共 50 条
  • [31] Data-centric routing in sensor networks: Single-hop broadcast or multi-hop unicast?
    Zhong, Xuan
    Khosla, Ravish
    Khanna, Gunjan
    Bagchi, Saurabh
    Coyle, Edward J.
    2007 IEEE 65TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-6, 2007, : 150 - 154
  • [32] Hop by Hop On Demand Path Selection Method for Sensor Networks
    Moon, Soo Young
    Cho, Tae Ho
    12TH INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATION TECHNOLOGY: ICT FOR GREEN GROWTH AND SUSTAINABLE DEVELOPMENT, VOLS 1 AND 2, 2010, : 547 - 550
  • [33] Single Hop Sensor Deployment Algorithm
    Chattopadhyay, Arup Kr.
    Bhattacharyya, Chandan Kr.
    Bhattacharya, Swapan
    2012 SIXTH INTERNATIONAL CONFERENCE ON SENSING TECHNOLOGY (ICST), 2012, : 347 - 352
  • [34] Sensor-Based Predictive Communication for Highly Dynamic Multi-Hop Vehicular Networks
    Alieiev, Roman
    Blumenstein, Jiri
    Marsalek, Roman
    Hehn, Thorsten
    Kwoczek, Andreas
    Kuerner, Thomas
    2017 25TH EUROPEAN SIGNAL PROCESSING CONFERENCE (EUSIPCO), 2017, : 633 - 637
  • [35] Low-latency Symbol-Synchronous Communication for Multi-hop Sensor Networks
    Liu, Xinlei
    Belogaev, Andrey
    Oostvogels, Jonathan
    Fang, Bingwu
    Hughes, Danny
    Weyn, Maarten
    Famaey, Jeroen
    2024 JOINT EUROPEAN CONFERENCE ON NETWORKS AND COMMUNICATIONS & 6G SUMMIT, EUCNC/6G SUMMIT 2024, 2024, : 1096 - 1101
  • [36] Communication Scheme to Support Sink Mobility in Multi-hop Clustered Wireless Sensor Networks
    Oh, Seungmin
    Lee, Euisin
    Park, Soochang
    Jung, Juhyun
    Kim, Sang-Ha
    2010 24TH IEEE INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS (AINA), 2010, : 866 - 872
  • [37] Multidestination communication over tunable-receiver single-hop WDM networks
    Rouskas, GN
    Ammar, MH
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1997, 15 (03) : 501 - 511
  • [38] Stochastic Analysis of a Single-Hop Communication Link in Vehicular Ad Hoc Networks
    Abboud, Khadige
    Zhuang, Weihua
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2014, 15 (05) : 2297 - 2307
  • [39] Network coding for hop-by-hop communication enhancement in multi-hop networks
    Pahlevani, Peyman
    Khamfroush, Hana
    Lucani, Daniel E.
    Pedersen, Morten V.
    Fitzek, Frank H. P.
    COMPUTER NETWORKS, 2016, 105 : 138 - 149
  • [40] Multidestination communication over tunable-receiver single-hop WDM networks
    North Carolina State Univ, Raleigh, United States
    IEEE J Sel Areas Commun, 3 (501-511):