Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Optimal number of routing paths in multi-path routing to minimize energy consumption in wireless sensor networks
Download
journal.pone.0081952.PDF
Date
2013-10-30
Author
İncebacak, Davut
Tavlı, Bulent
Bıcakçı, Kemal
Altın-Kayhan, Ayşegül
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
60
views
42
downloads
Cite This
In wireless sensor networks, multi-path routing is proposed for energy balancing which prolongs the network lifetime as compared to single-path routing where utilization of a single route between a source node and the base station results in imbalanced energy dissipation. While it is evident that increasing the number of routing paths mitigates the problem of energy over-utilization in a subset of nodes acting as relays, the net effect of the proliferation of multiple routing paths on energy balancing remains unclear. It is imperative to keep the number of routing paths as low as possible without significantly deteriorating the network lifetime; therefore, determination of the optimal number of routing paths in multi-path routing by considering the tradeoff in routing complexity and network lifetime extension is an interesting research problem. In this study, to investigate the impact of the number of routing paths in multi-path routing on network-wide energy balancing under optimal operating conditions, we build a novel mixed integer programming framework. We explore the parameter space consisting of a number of paths, number of nodes, maximum transmission range, network area, and network topology. The results of the analysis show that by utilizing the optimization scheme proposed, it is possible to achieve near-optimal energy consumption (within 1.0% neighborhood of the case where no restrictions are imposed on the number of routing paths in multi-path routing) using at most two paths for each node.
Subject Keywords
Signal Processing
,
Computer Networks and Communications
,
Computer Science Applications
URI
https://hdl.handle.net/11511/51038
Journal
EURASIP Journal on Wireless Communications and Networking
DOI
https://doi.org/10.1186/1687-1499-2013-252
Collections
Graduate School of Informatics, Article
Suggestions
OpenMETU
Core
Energy-aware routing algorithms for wireless ad hoc networks with heterogeneous power supplies
Vazifehdan, Javad; Prasad, R. Venkatesha; Onur, Ertan; Niemegeers, Ignas (Elsevier BV, 2011-10-27)
Although many energy-aware routing schemes have been proposed for wireless ad hoc networks, they are not optimized for networks with heterogeneous power supplies, where nodes may run on battery or be connected to the mains (grid network). In this paper, we propose several energy-aware routing algorithms for such ad hoc networks. The proposed algorithms feature directing the traffic load dynamically towards mains-powered devices keeping the hop count of selected routes minimal. We unify these algorithms into...
Optimal offline broadcast scheduling with an energy harvesting transmitter
Erkal, Hakan; Ozcelik, F. Mehmet; Uysal, Elif (Springer Science and Business Media LLC, 2013-07-18)
We consider an energy harvesting transmitter broadcasting individual data to two receivers. Data packets intended for each user are assumed to arrive at arbitrary but known instants. The goal is to minimize the total transmission time of the packets arriving within a certain time window, using the energy harvested during this time. Energy harvests are also modelled to occur at known discrete instants. An achievable rate region with structural properties satisfied by the two-user additive white Gaussian nois...
A simple and effective mechanism for stored video streaming with TCP transport and server-side adaptive frame discard
Gurses, E; Akar, Gözde; Akar, N (Elsevier BV, 2005-07-15)
Transmission control protocol (TCP) with its well-established congestion control mechanism is the prevailing transport layer protocol for non-real time data in current Internet Protocol (IP) networks. It would be desirable to transmit any type of multimedia data using TCP in order to take advantage of the extensive operational experience behind TCP in the Internet. However, some features of TCP including retransmissions and variations in throughput and delay, although not catastrophic for non-real time data...
Improving performance of network intrusion detection systems through concurrent mechanisms
Atakan, Mustafa; Şener, Cevat; Department of Computer Engineering (2003)
As the bandwidth of present networks gets larger than the past, the demand of Network Intrusion Detection Systems (NIDS) that function in real time becomes the major requirement for high-speed networks. If these systems are not fast enough to process all network traffic passing, some malicious security violations may take role using this drawback. In order to make that kind of applications schedulable, some concurrency mechanism is introduced to the general flowchart of their algorithm. The principal aim is...
Software implementations of QoS scheduling algorithms for high speed networks /
Pehlivanlı, Aydın; Schmidt, Şenan Ece; Department of Electrical and Electronics Engineering (2015)
The end to end Quality of Service (QoS) support for the dominating multimedia traffic in the contemporary computer networks is achieved by implementing schedulers in the routers and deploying traffic shapers. To this end, realistic modeling and simulation of these components is essential for network performance evaluation. The first contribution of this thesis is the design and implementation of a C++ simulator QueST (Quality of Service simulaTor) for this task. QueST is a modular cycle accurate simulator w...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
D. İncebacak, B. Tavlı, K. Bıcakçı, and A. Altın-Kayhan, “Optimal number of routing paths in multi-path routing to minimize energy consumption in wireless sensor networks,”
EURASIP Journal on Wireless Communications and Networking
, 2013, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/51038.