105 lines
13 KiB
BibTeX
105 lines
13 KiB
BibTeX
@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},
|
|
langid = {english},
|
|
}
|
|
|
|
@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{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},
|
|
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},
|
|
}
|