Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Bhattacharjee, Sanghita; | Bandyopadhyay, Subhansu
Affiliations: Department of Computer Science and Engineering, National Institute of Technology, Durgapur, India | Department of Computer Science and Engineering, University of Calcutta, Kolkata, India
Note: [] Corresponding author. Tel.: +919830619076; E-mail: [email protected]
Abstract: Energy efficiency is considered as an important design issue in multihop wireless networks as the nodes are battery limited. Energy efficiency can be achieved by establishing multiple paths. Multipath routing explores multiple disjoint paths between sources–sink pair in order to improve energy consumption at nodes and thus, provide robustness against possible node failure. However, it remains a challenging task in wireless networks due to associated interference. Reducing interference lowers the energy consumption, improving the network lifetime. This paper proposes an interference aware energy efficient multipath routing protocol for a given source-sink pair by a combined route construction and power allocation method. After finding k-minimum weight node disjoint paths on a weighted communication graph, iterative power allocation is performed on the derived paths considering signal to interference plus noise ratio (SINR) model. The power allocation method minimizes the interference experienced by each node at an acceptable level so that multiple transmissions can take place simultaneously. By alternatively invoking multipath route construction and power allocation method on a weighted communication graph, the proposed algorithm optimizes the assignment of transmission power and thereby minimizes the total energy consumption on k-node disjoint multipath. The simulation results show that the performance of the proposed scheme is better than existing multipath routing algorithms.
Keywords: SINR, SNR, communication graph, interfering node set, cost function, iterative power allocation method, k-node disjoint path
DOI: 10.3233/JHS-140503
Journal: Journal of High Speed Networks, vol. 20, no. 4, pp. 263-276, 2014
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]