New Lit Review
This commit is contained in:
parent
19d79b165c
commit
10c3ced742
12
main.tex
12
main.tex
|
|
@ -55,15 +55,17 @@ We will focus on key factors like:
|
|||
|
||||
\section*{Literature Review}\label{sec:lit_review}
|
||||
|
||||
The Minimum Spanning Tree (MST) is a potential routing protocol for mesh-based Wireless Sensor Networks (WSN). Algorithms like Prim's \cite{cormen_introduction_2009} and Kruskal's \cite{kruskal_shortest_1956} have attacted implementations in applications since they are simple to implement and effective in static networks, However, their direct application to Wireless Sensor Networks (WSNs) remains questionable.
|
||||
Designing a robust and efficient mesh network for real-time environmental monitoring poses unique challenges due to the resource-constrained nature of wireless sensor networks (WSNs). The Routing Protocol for Low-Power and Lossy Networks (RPL), a proactive routing protocol \cite{rechache_study_2021}, emerges as a promising candidate, addressing these challenges head-on with its standardized approach, dynamic routing capabilities, and energy-efficient design \cite{alexander_rpl_2012, Kharrufa2019RPL-Based}. Notably, RPL aligns well with our project's key objectives of scalability, reliability, and sustainability.
|
||||
|
||||
Recent research endeavors have delved into the potential of MSTs to enhance energy efficiency within WSN routing protocols. For instance, MSTEAM leverages localized MSTs to facilitate multicast routing, thereby minimizing energy consumption during message propagation \cite{frey_localized_2007}. Similarly, NNT offers a distributed approach to construct approximate MSTs, effectively reducing communication overhead \cite{4492767}. Additionally, CMSTR addresses the challenge of imbalanced energy consumption in hierarchical routing by employing constrained MSTs to establish energy-efficient intra-cluster communication paths \cite{lin_cmstr_2023}. These advancements highlight the promise of MST-based strategies in promoting energy-aware routing within WSNs, especially in $CO_2$ monitoring applications and specific deployment scenarios.
|
||||
One of RPL's critical strengths lies in its ability to dynamically adapt to network changes. An adaptation mentioned in \cite{kharrufa_dynamic_2017}, D-RPL, optimises multihop routing, guaranteeing reliable data collection even when nodes fail or move, or new ones are deployed, a crucial feature for real-time environmental monitoring where network conditions are constantly shifting.
|
||||
|
||||
In an MST-based WSN, there is necessity for each node to compute shortest paths to all others, which significantly escalates complexity and energy consumption \cite{wan_minimum-energy_2001}. Moreover, the static nature of MSTs requires recalculations upon network alterations, potentially causing delays and packet loss. In complex environments, MSTs may not always ensure the most energy-efficient paths, further complicating their practical utility.
|
||||
Furthermore, RPL prioritizes energy efficiency \cite{info8040124}. By employing energy-aware path selection and minimizing control overhead, RPL extends the lifespan of individual nodes and the overall network, a significant advantage in resource-constrained environments.
|
||||
|
||||
Nevertheless, MSTs offer a hierarchical routing topology, which has been proven to be scalable and energy efficient in WSNs \cite{liu_atypical_2015}. A potential solution could adopt a reactive approach, where the sink node initiates data collection through controlled broadcasts or multicasts. Subsequently, leaf nodes transmit data along pre-computed, energy-efficient paths towards the sink, facilitated by intermediate nodes. This reactive paradigm appears promising for static WSN deployments, providing a balance between simplicity and efficiency.
|
||||
Finally, RPL exhibits excellent scalability, making it suitable for large-scale WSNs like the one envisioned for the application. Its hierarchical design effectively handles complex network structures, ensuring efficient data routing even as the network grows in size and complexity.
|
||||
|
||||
In conclusion, while MSTs exhibit limitations in certain WSN scenarios, their adaptability and potential for energy-efficient routing make them a compelling area for further investigation, particularly in $CO_{2}$ monitoring applications.
|
||||
While RPL boasts significant advantages, careful consideration must be given to its limitations before implementation. Security measures require meticulous implementation to address potential vulnerabilities in resource-constrained environments \cite{arena_evaluating_2020, mayzaud_distributed_2017, 8998289}. Additionally, RPL's dynamic nature can introduce complexity and overhead compared to simpler protocols, demanding thoughtful analysis and optimization.
|
||||
|
||||
Balancing RPL's strengths with its limitations is crucial. Its dynamic routing, energy efficiency, and scalability hold immense potential for achieving our project's goals. Leveraging RPL's features, particularly its dynamic routing and multipathing capabilities, promises timely data collection even in dynamic network environments, contributing to a successful monitoring application. Further investigation and experimentation are necessary to determine the optimal configuration and potential adaptations required for RPL to seamlessly integrate into our specific project and effectively meet the desired outcomes.
|
||||
|
||||
\newpage
|
||||
\printbibliography
|
||||
|
|
|
|||
|
|
@ -1,104 +1,115 @@
|
|||
@thesis{frey_localized_2007,
|
||||
title = {Localized Minimum Spanning Tree Based Multicast Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Sensor Networks},
|
||||
url = {https://inria.hal.science/inria-00153816},
|
||||
abstract = {We present a minimum spanning tree based energy aware multicast protocol ({MSTEAM}), which is a localized geographic multicast routing scheme designed for ad hoc and sensor networks. It uses locally-built minimum spanning trees ({MST}) as an efficient approximation of the optimal multicasting backbone. Using a {MST} is highly relevant in the context of dynamic wireless networks since its computation has a low time complexity (O(n log n)). Moreover, our protocol is fully localized and requires nodes to gather information only on 1-hop neighbors, which is common assumption in existing work. In {MSTEAM}, a message split occurs when the {MST} over the current node and the set of destinations has multiple edges originated at the current node. Destinations spanned by each of these edges are grouped together, and for each of these subsets the best neighbor is selected as the next hop. This selection is based on a cost over progress metric, where the progress is approximated by subtracting the weight of the {MST} over a given neighbor and the subset of destinations to the weight of the {MST} over the current node and the subset of destinations. Since such greedy localized scheme may lead the message to a void area (i.e., there is no neighbor providing positive progress toward the destinations), we also propose a completely new multicast generalization of the well-know face recovery mechanism. We provide a theoretical analysis proving that {MSTEAM} is loop-free and always achieves delivery of the multicast message, as long as a path exists between the source node and the destinations. Our experimental results demonstrate that {MSTEAM} is highly energy-efficient, outperforms the best existing localized multicast scheme and is almost as efficient as a centralized scheme in high densities.},
|
||||
institution = {{INRIA}},
|
||||
type = {report},
|
||||
author = {Frey, Hannes and Ingelrest, François and Simplot-Ryl, David},
|
||||
urldate = {2024-02-09},
|
||||
date = {2007},
|
||||
@report{alexander_rpl_2012,
|
||||
title = {{RPL}: {IPv}6 Routing Protocol for Low-Power and Lossy Networks},
|
||||
url = {https://datatracker.ietf.org/doc/rfc6550},
|
||||
shorttitle = {{RPL}},
|
||||
abstract = {Low-Power and Lossy Networks ({LLNs}) are a class of network in which both the routers and their interconnect are constrained. {LLN} routers typically operate with constraints on processing power, memory, and energy (battery power). Their interconnects are characterized by high loss rates, low data rates, and instability. {LLNs} are comprised of anything from a few dozen to thousands of routers. Supported traffic flows include point-to-point (between devices inside the {LLN}), point-to-multipoint (from a central control point to a subset of devices inside the {LLN}), and multipoint-to-point (from devices inside the {LLN} towards a central control point). This document specifies the {IPv}6 Routing Protocol for Low-Power and Lossy Networks ({RPL}), which provides a mechanism whereby multipoint-to-point traffic from devices inside the {LLN} towards a central control point as well as point-to-multipoint traffic from the central control point to the devices inside the {LLN} are supported. Support for point-to-point traffic is also available. [{STANDARDS}-{TRACK}]},
|
||||
number = {{RFC} 6550},
|
||||
institution = {Internet Engineering Task Force},
|
||||
type = {Request for Comments},
|
||||
author = {Alexander, Roger and Brandt, Anders and Vasseur, J. P. and Hui, Jonathan and Pister, Kris and Thubert, Pascal and Levis, P. and Struik, Rene and Kelsey, Richard and Winter, Tim},
|
||||
urldate = {2024-02-12},
|
||||
date = {2012-03},
|
||||
doi = {10.17487/RFC6550},
|
||||
note = {Num Pages: 157},
|
||||
}
|
||||
|
||||
@article{Kharrufa2019RPL-Based,
|
||||
title={RPL-Based Routing Protocols in IoT Applications: A Review},
|
||||
author={Harith Kharrufa and H. Al-Kashoash and A. Kemp},
|
||||
journal={IEEE Sensors Journal},
|
||||
year={2019},
|
||||
volume={19},
|
||||
pages={5952-5967},
|
||||
doi={10.1109/JSEN.2019.2910881}
|
||||
}
|
||||
|
||||
@inproceedings{kharrufa_dynamic_2017,
|
||||
title = {Dynamic {RPL} for multi-hop routing in {IoT} applications},
|
||||
url = {https://ieeexplore.ieee.org/document/7888753},
|
||||
doi = {10.1109/WONS.2017.7888753},
|
||||
abstract = {The Routing Protocol for Low Power and Lossy Networks ({RPL}) has become the standard routing protocol for the Internet of Things ({IoT}). This paper investigates the use of {RPL} in dynamic networks and presents an enhanced {RPL} for different applications with dynamic mobility and diverse network requirements. This implementation of {RPL} is designed with a new dynamic Objective-Function (D-{OF}) to improve the Packet Delivery Ratio ({PDR}), end-to-end delay and energy consumption while maintaining low packet overhead and loop-avoidance. We propose a controlled reverse-trickle timer based on received signal strength identification ({RSSI}) readings to maintain high responsiveness with minimum overhead and consult the objective function when a movement or an inconsistency is detected to help nodes make an informed decision. Simulations are done using Cooja with random waypoint mobility scenario for healthcare applications considering multi-hop routing. The results show that the proposed dynamic {RPL} (D-{RPL}) adapts to the nodes mobility and has a higher {PDR}, slightly lower end-to-end delay and reasonable energy consumption compared to related existing protocols.},
|
||||
eventtitle = {2017 13th Annual Conference on Wireless On-demand Network Systems and Services ({WONS})},
|
||||
pages = {100--103},
|
||||
booktitle = {2017 13th Annual Conference on Wireless On-demand Network Systems and Services ({WONS})},
|
||||
author = {Kharrufa, Harith and Al-Kashoash, Hayder and Al-Nidawi, Yaarob and Mosquera, Maria Quezada and Kemp, A.H.},
|
||||
urldate = {2024-02-12},
|
||||
date = {2017-02},
|
||||
keywords = {Linear programming, Measurement, Mobile nodes, Protocols, Routing, Wireless sensor networks},
|
||||
}
|
||||
|
||||
@thesis{rechache_study_2021,
|
||||
title = {Study of Performance Evaluation of {RPL} Objective Functions ({MRHOF} and {OF}0) for {IOTs}},
|
||||
url = {http://dspace.univ-ouargla.dz/jspui/handle/123456789/29110},
|
||||
abstract = {3
|
||||
Abstract
|
||||
{IPv}6 routing protocol for low-power and lossy networks ({RPL}) is a proactive dynamic routing protocol based on {IPV}6 with tow known objective functions ({OFs}): objective function zero ({OF}0) and minimum rank with hysteresis objective function ({MRHOF}).
|
||||
this memoir, provides an overiew of this protocol with a performance study of the two {OFs} used in {RPL}. Several scenarios have been tested with 20,30,40 and 50 nodes, with tow deffernt topologies (random and linear topology) and two parameters of comparisons were selected packet dilevery ratio and power consumption under differnt values of Packet Reception Ratio {RX} (20,40,60,80 and 100) in order to have an idea of suitability performance of {RPL} in each scenario.
|
||||
The simulation is done using the cooja simulator in our implementation cooja is a flexible java-based simulator which support C java native interface. We have chosen a cooja simulator as it is a very useful tool for software development in wireless sensor networks and will provide a suitable method in which to set the environment needs.},
|
||||
institution = {{UNIVERSITY} {OF} {KASDI} {MERBAH} {OUARGLA}},
|
||||
type = {Thesis},
|
||||
author = {Rechache, Manar},
|
||||
urldate = {2024-02-11},
|
||||
date = {2021},
|
||||
langid = {english},
|
||||
note = {Accepted: 2022-05-23T07:21:53Z},
|
||||
}
|
||||
|
||||
@article{lin_cmstr_2023,
|
||||
title = {{CMSTR}: A Constrained Minimum Spanning Tree Based Routing Protocol for Wireless Sensor Networks},
|
||||
volume = {146},
|
||||
issn = {1570-8705},
|
||||
url = {https://www.sciencedirect.com/science/article/pii/S157087052300080X},
|
||||
doi = {10.1016/j.adhoc.2023.103160},
|
||||
shorttitle = {{CMSTR}},
|
||||
abstract = {How to extend the network lifetime with given limited energy budget is always one of the main concerns in Wireless Sensor Networks ({WSNs}). However, imbalanced energy consumption and overlong intra-cluster communication paths are prevalent in the hierarchical routing protocols, which shortens the network lifetime inevitably. To this end, an energy-efficient routing Protocol based on Constrained Minimum Spanning Tree ({CMSTR}) is proposed in this paper. To be specific, a new multichain routing scheme to balance the energy consumption for intra-cluster communications is presented. Based on the multichain routing scheme, the problem of establishing intra-cluster routing is transformed into a shortest Hamiltonian path problem on the basis of a graph-theoretic analysis model, which is solved through a Constrained Minimum Spanning Tree ({CMST}) algorithm proposed in this paper, with the aim to obtain the initial path for intra-cluster communications. In order to shorten the initial path length to obtain higher energy-efficient chain routes, a Neighbor Node Replacement ({NNR}) algorithm and a Link Intersection Detection and Elimination ({LIDE}) algorithm are proposed, in which the problem of potential long links and intersections is to be effectively alleviated. With shorter chain routes, unnecessary intra-cluster communication energy depletion can be reduced accordingly. In order to evaluate the performance of {CMSTR}, extensive simulation experiments are conducted. The results show that {CMSTR} can greatly prolong the network lifetime with regard to the metrics of {FND} and {HND}. To be specific, compared with {LEACH}, R-{LEACH}, and {DCMSTR}, the value of {FND} increased by 800\%, 540\% and 57\%, that of {HND} increased by 322\%, 286\% and 22\%, and overall network lifetime ({AND}) increased by 29\%, 10\% and 5\%, respectively. Besides, {CMSTR} has a stable and lowest packet loss percentage (0.4\%). In summary, {CMSTR} has excellent performance in terms of energy efficiency and network stability.},
|
||||
pages = {103160},
|
||||
journaltitle = {Ad Hoc Networks},
|
||||
shortjournal = {Ad Hoc Networks},
|
||||
author = {Lin, Deyu and Lin, Zihao and Kong, Linghe and Guan, Yong Liang},
|
||||
urldate = {2024-02-09},
|
||||
date = {2023-07-01},
|
||||
keywords = {Energy efficient, Long link and intersection elimination, Network lifetime, Shortest hamiltonian path, Wireless sensor networks ({WSNs})},
|
||||
@article{arena_evaluating_2020,
|
||||
title = {Evaluating and improving the scalability of {RPL} security in the Internet of Things},
|
||||
volume = {151},
|
||||
issn = {0140-3664},
|
||||
url = {https://www.sciencedirect.com/science/article/pii/S0140366419307479},
|
||||
doi = {10.1016/j.comcom.2019.12.062},
|
||||
abstract = {Wireless Sensor and Actuator Networks ({WSANs}) will represent a key building block for the future Internet of Things, as a cheap and easily-deployable technology to connect smart devices on a large scale. In {WSAN} the Routing Protocol for Low-Power and Lossy Networks ({RPL}) has a crucial role as the standard {IPv}6-based routing protocol. {RPL} specifications define a basic set of security features, without which it would be open to disruptive routing attacks. However, the impact of these features on the {WSAN} performance has not been thoroughly investigated yet. The contribution of this paper is two-fold. First, we extensively evaluate the impact of security mechanisms on the scalability of {WSANs} by means of both simulations and real experiments. We show that the protection against eavesdropping and forgery has a modest impact on the performance, whereas the protection against replay has a more considerable impact, especially on the network formation time which increases noticeably. Despite this, we show that protecting against replay reduces the number of control messages exchanged and improves routes optimality. For these reasons, we recommend to always use the security mechanisms. Finally, we propose a standard-compliant optimization for defending against replay that reduces the impact on the overall performance.},
|
||||
pages = {119--132},
|
||||
journaltitle = {Computer Communications},
|
||||
shortjournal = {Computer Communications},
|
||||
author = {Arena, Antonio and Perazzo, Pericle and Vallati, Carlo and Dini, Gianluca and Anastasi, Giuseppe},
|
||||
urldate = {2024-02-12},
|
||||
date = {2020-02-01},
|
||||
keywords = {Embedded systems, Internet of Things, Performance evaluation, {RPL}, Secure routing},
|
||||
}
|
||||
|
||||
@ARTICLE{4492767,
|
||||
author={Khan, Maleq and Pandurangan, Gopal and Anil Kumar, V.S.},
|
||||
journal={IEEE Transactions on Parallel and Distributed Systems},
|
||||
title={Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks},
|
||||
year={2009},
|
||||
|
||||
@Article{info8040124,
|
||||
AUTHOR = {Zhu, Licai and Wang, Ruchuan and Yang, Hao},
|
||||
TITLE = {Multi-Path Data Distribution Mechanism Based on RPL for Energy Consumption and Time Delay},
|
||||
JOURNAL = {Information},
|
||||
VOLUME = {8},
|
||||
YEAR = {2017},
|
||||
NUMBER = {4},
|
||||
ARTICLE-NUMBER = {124},
|
||||
URL = {https://www.mdpi.com/2078-2489/8/4/124},
|
||||
ISSN = {2078-2489},
|
||||
ABSTRACT = {The RPL (Routing Protocol for LLN) protocol is a routing protocol for low power and lossy networks. In such a network, energy is a very scarce resource, so many studies are focused on minimizing global energy consumption. End-to-end latency is another important performance indicator of the network, but existing research tends to focus more on energy consumption and ignore the end-to-end delay of data transmission. In this paper, we propose a kind of energy equalization routing protocol to maximize the surviving time of the restricted nodes so that the energy consumed by each node is close to each other. At the same time, a multi-path forwarding route is proposed based on the cache utilization. The data is sent to the sink node through different parent nodes at a certain probability, not only by selecting the preferred parent node, thus avoiding buffer overflow and reducing end-to-end delay. Finally, the two algorithms are combined to accommodate different application scenarios. The experimental results show that the proposed three improved schemes improve the reliability of the routing, extend the lifetime of the network, reduce the end-to-end delay, and reduce the number of DAG reconfigurations.},
|
||||
DOI = {10.3390/info8040124}
|
||||
}
|
||||
|
||||
@article{mayzaud_distributed_2017,
|
||||
title = {A Distributed Monitoring Strategy for Detecting Version Number Attacks in {RPL}-Based Networks},
|
||||
volume = {14},
|
||||
issn = {1932-4537},
|
||||
url = {https://ieeexplore.ieee.org/document/7930501},
|
||||
doi = {10.1109/TNSM.2017.2705290},
|
||||
abstract = {The Internet of Things is characterized by the large-scale deployment of low power and lossy networks ({LLN}), interconnecting pervasive objects. The routing protocol for {LLN} ({RPL}) protocol has been standardized by {IETF} to enable a lightweight and robust routing in these constrained networks. A versioning mechanism is incorporated into {RPL} in order to maintain an optimized topology. However, an attacker can exploit this mechanism to significantly damage the network and reduce its lifetime. After analyzing and comparing existing work, we propose in this paper a monitoring strategy with dedicated algorithms for detecting such attacks and identifying the involved malicious nodes. The performance of this solution is evaluated through extensive experiments, and its scalability is quantified with the support of a monitoring node placement optimization method.},
|
||||
pages = {472--486},
|
||||
number = {2},
|
||||
journaltitle = {{IEEE} Transactions on Network and Service Management},
|
||||
author = {Mayzaud, Anthéa and Badonnel, Rémi and Chrisment, Isabelle},
|
||||
urldate = {2024-02-12},
|
||||
date = {2017-06},
|
||||
note = {Conference Name: {IEEE} Transactions on Network and Service Management},
|
||||
keywords = {Internet of Things, Maintenance engineering, Monitoring, Network topology, Protocols, {RPL}, Security, Security management, Topology},
|
||||
}
|
||||
|
||||
@ARTICLE{8998289,
|
||||
author={Verma, Abhishek and Ranga, Virender},
|
||||
journal={IEEE Sensors Journal},
|
||||
title={Security of RPL Based 6LoWPAN Networks in the Internet of Things: A Review},
|
||||
year={2020},
|
||||
volume={20},
|
||||
number={1},
|
||||
pages={124-139},
|
||||
keywords={Distributed algorithms;Wireless sensor networks;Energy efficiency;Algorithm design and analysis;Approximation algorithms;Nearest neighbor searches;Buildings;Communication networks;Routing;Distributed Algorthms;Minimum Spanning Tree;Sensor networks;Approximation Algorithms;Probabilistic Analysis;Distributed Algorthms;Minimum Spanning Tree;Sensor networks;Approximation Algorithms;Probabilistic Analysis},
|
||||
doi={10.1109/TPDS.2008.57}}
|
||||
|
||||
|
||||
@book{cormen_introduction_2009,
|
||||
title = {Introduction to Algorithms, third edition},
|
||||
isbn = {978-0-262-03384-8},
|
||||
abstract = {The latest edition of the essential text and professional reference, with substantial new material on such topics as {vEB} trees, multithreaded algorithms, dynamic programming, and edge-based flow.Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called “Divide-and-Conquer”), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.},
|
||||
pagetotal = {1314},
|
||||
publisher = {{MIT} Press},
|
||||
author = {Cormen, Thomas H. and Leiserson, Charles E. and Rivest, Ronald L. and Stein, Clifford},
|
||||
date = {2009-07-31},
|
||||
langid = {english},
|
||||
keywords = {Computers / Programming / Algorithms, Computers / Reference},
|
||||
}
|
||||
|
||||
@article{kruskal_shortest_1956,
|
||||
title = {On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem},
|
||||
volume = {7},
|
||||
issn = {0002-9939},
|
||||
url = {https://www.jstor.org/stable/2033241},
|
||||
doi = {10.2307/2033241},
|
||||
pages = {48--50},
|
||||
number = {1},
|
||||
journaltitle = {Proceedings of the American Mathematical Society},
|
||||
author = {Kruskal, Joseph B.},
|
||||
urldate = {2024-02-09},
|
||||
date = {1956},
|
||||
note = {Publisher: American Mathematical Society},
|
||||
}
|
||||
|
||||
@inproceedings{wan_minimum-energy_2001,
|
||||
title = {Minimum-energy broadcast routing in static ad hoc wireless networks},
|
||||
volume = {2},
|
||||
url = {https://ieeexplore.ieee.org/document/916310},
|
||||
doi = {10.1109/INFCOM.2001.916310},
|
||||
abstract = {Energy conservation is a critical issue in ad hoc wireless networks for node and network life, as the nodes are powered by batteries only. One major approach for energy conservation is to route a communication session along the routes which requires the lowest total energy consumption. This optimization problem is referred to as minimum-energy routing. While minimum-energy unicast routing can be solved in polynomial time by shortest-path algorithms, it remains open whether minimum-energy broadcast routing can be solved in polynomial time, despite the {NP}-hardness of its general graph version. Previously three greedy heuristics were proposed in Wieselthier et al. (2000): {MST} (minimum spanning tree), {SPT} (shortest-path tree), and {BIP} (broadcasting incremental power). They have been evaluated through simulations in Wieselthier et al.], but little is known about their analytical performance. The main contribution of this paper is the quantitative characterization of their performances in terms of approximation ratios. By exploring geometric structures of Euclidean {MSTs}, we have been able to prove that the approximation ratio of {MST} is between 6 and 12, and the approximation ratio of {BIP} is between /sup 13///sub 3/ and 12. On the other hand, the approximation ratio of {SPT} is shown to be at least /sup n///sub 2/, where n is the number of receiving nodes. To our best knowledge, these are the first analytical results for minimum-energy broadcasting.},
|
||||
eventtitle = {Proceedings {IEEE} {INFOCOM} 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the {IEEE} Computer and Communications Society (Cat. No.01CH37213)},
|
||||
pages = {1162--1171 vol.2},
|
||||
booktitle = {Proceedings {IEEE} {INFOCOM} 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the {IEEE} Computer and Communications Society (Cat. No.01CH37213)},
|
||||
author = {Wan, P.-J. and Calinescu, G. and Li, X.-Y. and Frieder, O.},
|
||||
urldate = {2024-02-10},
|
||||
date = {2001-04},
|
||||
note = {{ISSN}: 0743-166X},
|
||||
keywords = {Analytical models, Batteries, Broadcasting, Energy conservation, Energy consumption, Polynomials, Routing, Tree graphs, Unicast, Wireless networks},
|
||||
file = {IEEE Xplore Abstract Record:/home/junwei/Zotero/storage/5B9MZ4FJ/916310.html:text/html;Submitted Version:/home/junwei/Zotero/storage/T5NITGCK/Wan et al. - 2001 - Minimum-energy broadcast routing in static ad hoc .pdf:application/pdf},
|
||||
}
|
||||
|
||||
|
||||
@article{liu_atypical_2015,
|
||||
title = {Atypical Hierarchical Routing Protocols for Wireless Sensor Networks: A Review},
|
||||
volume = {15},
|
||||
issn = {1558-1748},
|
||||
url = {https://ieeexplore.ieee.org/document/7124398},
|
||||
doi = {10.1109/JSEN.2015.2445796},
|
||||
shorttitle = {Atypical Hierarchical Routing Protocols for Wireless Sensor Networks},
|
||||
abstract = {Hierarchical routing in wireless sensor networks ({WSNs}) is a very important topic that has been attracting the research community in the last decade. Typical hierarchical routing is called clustering routing, in which the network is divided into multiple clusters. Recently, some types of atypical hierarchical routing arise, including chain-based, tree-based, grid-based routing, and area-based routing. There are several survey papers that present and compare the hierarchical routing protocols from various perspectives, but a survey on atypical hierarchical routing is still missing. This paper makes a first attempt to provide a comprehensive review on atypical hierarchical routing. We offer a classification of atypical hierarchical routing of {WSNs}, and give detailed analysis of different logical topologies. The most representative atypical hierarchical routing protocols are described, discussed, and qualitatively compared. In particular, the advantages and disadvantages of different atypical hierarchical routing protocols are analyzed with respect to their significant performances and application scenarios. Finally, we put forward some open issues concerning the design of hierarchical {WSNs}. This survey aims to provide useful guidance for system designers on how to evaluate and select appropriate logical topologies and hierarchical routing protocols for specific applications.},
|
||||
pages = {5372--5383},
|
||||
number = {10},
|
||||
journaltitle = {{IEEE} Sensors Journal},
|
||||
author = {Liu, Xuxun},
|
||||
urldate = {2024-02-10},
|
||||
date = {2015-10},
|
||||
note = {Conference Name: {IEEE} Sensors Journal},
|
||||
keywords = {area-based, atypical hierarchical routing, chain-based, Data communication, Energy consumption, grid-based, Routing, Routing protocols, Sensors, Topology, tree-based, Wireless sensor networks},
|
||||
file = {IEEE Xplore Abstract Record:/home/junwei/Zotero/storage/K9II5R3A/7124398.html:text/html;IEEE Xplore Full Text PDF:/home/junwei/Zotero/storage/EEEQLHTQ/Liu - 2015 - Atypical Hierarchical Routing Protocols for Wirele.pdf:application/pdf},
|
||||
number={11},
|
||||
pages={5666-5690},
|
||||
keywords={Security;Routing;Wireless sensor networks;Taxonomy;Routing protocols;Sensors;Internet of Things;RPL;6LoWPAN;LLN;network security},
|
||||
doi={10.1109/JSEN.2020.2973677}
|
||||
}
|
||||
|
|
|
|||
Loading…
Reference in New Issue