Loading…
Energy-Efficient Self-Organizing Routing for Wireless Mobile Networks
The instant deployment without relying on an existing infrastructure makes mobile ad hoc networks (MANET) a striking choice for many dynamic situations. An efficient MANET protocol may be applied to other important emerging wireless technologies, such as wireless mesh and sensor networks. This artic...
Saved in:
Published in: | International journal of business data communications and networking 2009-10, Vol.5 (4), p.52-69 |
---|---|
Main Authors: | , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | cdi_FETCH-LOGICAL-c420t-80d0f6939cb78db967b148cf069362325c36c40ce7a94b85ee0959155d0202d63 |
container_end_page | 69 |
container_issue | 4 |
container_start_page | 52 |
container_title | International journal of business data communications and networking |
container_volume | 5 |
creator | Moh, Melody Kukanur, Rashmi Lin, Xuquan Dhar, Subhankar |
description | The instant deployment without relying on an existing infrastructure makes mobile ad hoc networks (MANET) a striking choice for many dynamic situations. An efficient MANET protocol may be applied to other important emerging wireless technologies, such as wireless mesh and sensor networks. This article proposes a hierarchical routing scheme that is scalable, energy efficient, and self-organizing. The new algorithm that is discussed in this article is the Dynamic Leader Set Generation (DLSG). This algorithm dynamically selects leader nodes based on traffic demand, locality, and residual energy level, and de-selects them based on residual energy. Therefore, energy consumption and traffic load are balanced throughout the network, and the network reorganizes itself around the dynamically selected leader nodes. Time, space, and message complexities are formally analyzed and implementation issues are also addressed. Incorporating the IEEE 802.11 medium access control mechanism and including the power saving mode, performance evaluation is carried out by simulating DLSG and four existing hierarchical routing algorithms. It shows that DLSG successfully extends network lifetime by 20 to 50% while achieving a comparable level of network performance. |
doi_str_mv | 10.4018/jbdcn.2009091704 |
format | article |
fullrecord | <record><control><sourceid>gale_cross</sourceid><recordid>TN_cdi_crossref_primary_10_4018_jbdcn_2009091704</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A211366097</galeid><sourcerecordid>A211366097</sourcerecordid><originalsourceid>FETCH-LOGICAL-c420t-80d0f6939cb78db967b148cf069362325c36c40ce7a94b85ee0959155d0202d63</originalsourceid><addsrcrecordid>eNp1kctLxDAQh4so-Lx7LHjx0nWStGlzFFkf4AN8oLfQppOStZusSRdZ_3pbXVyUlRwmhG8mv-SLokMCoxRIcTKpamVHFECAIDmkG9EOydIiAZ6-bP7sGdmOdkOYALCMUbITjccWfbNIxlobZdB28QO2OrnzTWnNh7FNfO_m3VC18_Gz8dhiCPGNq0yL8S12786_hv1oS5dtwINl3YuezsePZ5fJ9d3F1dnpdaJSCl1SQA2aCyZUlRd1JXhekbRQGvozThnNFOMqBYV5KdKqyBBBZIJkWQ0UaM3ZXnT8PXfm3dscQyenJihs29KimwdJgBEquCgG9OgPOnFzb_t0kgqWU0JoLlZUU7YojdWu86UahsrTHmGcg8h7arSG6leNU6OcRd1_xu8G-G5Q3oXgUcuZN9PSL_qEctAlv3TJla7V00xjVlH_YnJW6x49X4M2C_kjUQ4S5VLif1dm7BNUJ6rK</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2937211279</pqid></control><display><type>article</type><title>Energy-Efficient Self-Organizing Routing for Wireless Mobile Networks</title><source>ABI/INFORM Global</source><creator>Moh, Melody ; Kukanur, Rashmi ; Lin, Xuquan ; Dhar, Subhankar</creator><creatorcontrib>Moh, Melody ; Kukanur, Rashmi ; Lin, Xuquan ; Dhar, Subhankar</creatorcontrib><description>The instant deployment without relying on an existing infrastructure makes mobile ad hoc networks (MANET) a striking choice for many dynamic situations. An efficient MANET protocol may be applied to other important emerging wireless technologies, such as wireless mesh and sensor networks. This article proposes a hierarchical routing scheme that is scalable, energy efficient, and self-organizing. The new algorithm that is discussed in this article is the Dynamic Leader Set Generation (DLSG). This algorithm dynamically selects leader nodes based on traffic demand, locality, and residual energy level, and de-selects them based on residual energy. Therefore, energy consumption and traffic load are balanced throughout the network, and the network reorganizes itself around the dynamically selected leader nodes. Time, space, and message complexities are formally analyzed and implementation issues are also addressed. Incorporating the IEEE 802.11 medium access control mechanism and including the power saving mode, performance evaluation is carried out by simulating DLSG and four existing hierarchical routing algorithms. It shows that DLSG successfully extends network lifetime by 20 to 50% while achieving a comparable level of network performance.</description><identifier>ISSN: 1548-0631</identifier><identifier>EISSN: 1548-064X</identifier><identifier>DOI: 10.4018/jbdcn.2009091704</identifier><language>eng</language><publisher>Hershey: IGI Global</publisher><subject>Access control ; Ad hoc networks (Computer networks) ; Algorithms ; Computer networks ; Dynamics ; Energy consumption ; Energy levels ; Finite element method ; Mobile ad hoc networks ; Mobile communication systems ; Networks ; Nodes ; Performance evaluation ; Residual energy ; Routing (telecommunications) ; Traffic engineering ; Traffic flow ; Wireless communication systems ; Wireless networks</subject><ispartof>International journal of business data communications and networking, 2009-10, Vol.5 (4), p.52-69</ispartof><rights>COPYRIGHT 2009 IGI Global</rights><rights>Copyright © 2009, IGI Global. Copying or distributing in print or electronic forms without written permission of IGI Global is prohibited.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c420t-80d0f6939cb78db967b148cf069362325c36c40ce7a94b85ee0959155d0202d63</cites><orcidid>0000-0002-8313-6645</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/2937211279/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2937211279?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,780,784,11688,27924,27925,36060,36061,44363,74895</link.rule.ids></links><search><creatorcontrib>Moh, Melody</creatorcontrib><creatorcontrib>Kukanur, Rashmi</creatorcontrib><creatorcontrib>Lin, Xuquan</creatorcontrib><creatorcontrib>Dhar, Subhankar</creatorcontrib><title>Energy-Efficient Self-Organizing Routing for Wireless Mobile Networks</title><title>International journal of business data communications and networking</title><description>The instant deployment without relying on an existing infrastructure makes mobile ad hoc networks (MANET) a striking choice for many dynamic situations. An efficient MANET protocol may be applied to other important emerging wireless technologies, such as wireless mesh and sensor networks. This article proposes a hierarchical routing scheme that is scalable, energy efficient, and self-organizing. The new algorithm that is discussed in this article is the Dynamic Leader Set Generation (DLSG). This algorithm dynamically selects leader nodes based on traffic demand, locality, and residual energy level, and de-selects them based on residual energy. Therefore, energy consumption and traffic load are balanced throughout the network, and the network reorganizes itself around the dynamically selected leader nodes. Time, space, and message complexities are formally analyzed and implementation issues are also addressed. Incorporating the IEEE 802.11 medium access control mechanism and including the power saving mode, performance evaluation is carried out by simulating DLSG and four existing hierarchical routing algorithms. It shows that DLSG successfully extends network lifetime by 20 to 50% while achieving a comparable level of network performance.</description><subject>Access control</subject><subject>Ad hoc networks (Computer networks)</subject><subject>Algorithms</subject><subject>Computer networks</subject><subject>Dynamics</subject><subject>Energy consumption</subject><subject>Energy levels</subject><subject>Finite element method</subject><subject>Mobile ad hoc networks</subject><subject>Mobile communication systems</subject><subject>Networks</subject><subject>Nodes</subject><subject>Performance evaluation</subject><subject>Residual energy</subject><subject>Routing (telecommunications)</subject><subject>Traffic engineering</subject><subject>Traffic flow</subject><subject>Wireless communication systems</subject><subject>Wireless networks</subject><issn>1548-0631</issn><issn>1548-064X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><sourceid>M0C</sourceid><recordid>eNp1kctLxDAQh4so-Lx7LHjx0nWStGlzFFkf4AN8oLfQppOStZusSRdZ_3pbXVyUlRwmhG8mv-SLokMCoxRIcTKpamVHFECAIDmkG9EOydIiAZ6-bP7sGdmOdkOYALCMUbITjccWfbNIxlobZdB28QO2OrnzTWnNh7FNfO_m3VC18_Gz8dhiCPGNq0yL8S12786_hv1oS5dtwINl3YuezsePZ5fJ9d3F1dnpdaJSCl1SQA2aCyZUlRd1JXhekbRQGvozThnNFOMqBYV5KdKqyBBBZIJkWQ0UaM3ZXnT8PXfm3dscQyenJihs29KimwdJgBEquCgG9OgPOnFzb_t0kgqWU0JoLlZUU7YojdWu86UahsrTHmGcg8h7arSG6leNU6OcRd1_xu8G-G5Q3oXgUcuZN9PSL_qEctAlv3TJla7V00xjVlH_YnJW6x49X4M2C_kjUQ4S5VLif1dm7BNUJ6rK</recordid><startdate>20091001</startdate><enddate>20091001</enddate><creator>Moh, Melody</creator><creator>Kukanur, Rashmi</creator><creator>Lin, Xuquan</creator><creator>Dhar, Subhankar</creator><general>IGI Global</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PYYUZ</scope><scope>Q9U</scope><orcidid>https://orcid.org/0000-0002-8313-6645</orcidid></search><sort><creationdate>20091001</creationdate><title>Energy-Efficient Self-Organizing Routing for Wireless Mobile Networks</title><author>Moh, Melody ; Kukanur, Rashmi ; Lin, Xuquan ; Dhar, Subhankar</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c420t-80d0f6939cb78db967b148cf069362325c36c40ce7a94b85ee0959155d0202d63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Access control</topic><topic>Ad hoc networks (Computer networks)</topic><topic>Algorithms</topic><topic>Computer networks</topic><topic>Dynamics</topic><topic>Energy consumption</topic><topic>Energy levels</topic><topic>Finite element method</topic><topic>Mobile ad hoc networks</topic><topic>Mobile communication systems</topic><topic>Networks</topic><topic>Nodes</topic><topic>Performance evaluation</topic><topic>Residual energy</topic><topic>Routing (telecommunications)</topic><topic>Traffic engineering</topic><topic>Traffic flow</topic><topic>Wireless communication systems</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Moh, Melody</creatorcontrib><creatorcontrib>Kukanur, Rashmi</creatorcontrib><creatorcontrib>Lin, Xuquan</creatorcontrib><creatorcontrib>Dhar, Subhankar</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ABI/INFORM Collection (ProQuest)</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer science database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>ProQuest advanced technologies & aerospace journals</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><jtitle>International journal of business data communications and networking</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Moh, Melody</au><au>Kukanur, Rashmi</au><au>Lin, Xuquan</au><au>Dhar, Subhankar</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Energy-Efficient Self-Organizing Routing for Wireless Mobile Networks</atitle><jtitle>International journal of business data communications and networking</jtitle><date>2009-10-01</date><risdate>2009</risdate><volume>5</volume><issue>4</issue><spage>52</spage><epage>69</epage><pages>52-69</pages><issn>1548-0631</issn><eissn>1548-064X</eissn><abstract>The instant deployment without relying on an existing infrastructure makes mobile ad hoc networks (MANET) a striking choice for many dynamic situations. An efficient MANET protocol may be applied to other important emerging wireless technologies, such as wireless mesh and sensor networks. This article proposes a hierarchical routing scheme that is scalable, energy efficient, and self-organizing. The new algorithm that is discussed in this article is the Dynamic Leader Set Generation (DLSG). This algorithm dynamically selects leader nodes based on traffic demand, locality, and residual energy level, and de-selects them based on residual energy. Therefore, energy consumption and traffic load are balanced throughout the network, and the network reorganizes itself around the dynamically selected leader nodes. Time, space, and message complexities are formally analyzed and implementation issues are also addressed. Incorporating the IEEE 802.11 medium access control mechanism and including the power saving mode, performance evaluation is carried out by simulating DLSG and four existing hierarchical routing algorithms. It shows that DLSG successfully extends network lifetime by 20 to 50% while achieving a comparable level of network performance.</abstract><cop>Hershey</cop><pub>IGI Global</pub><doi>10.4018/jbdcn.2009091704</doi><tpages>18</tpages><orcidid>https://orcid.org/0000-0002-8313-6645</orcidid></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1548-0631 |
ispartof | International journal of business data communications and networking, 2009-10, Vol.5 (4), p.52-69 |
issn | 1548-0631 1548-064X |
language | eng |
recordid | cdi_crossref_primary_10_4018_jbdcn_2009091704 |
source | ABI/INFORM Global |
subjects | Access control Ad hoc networks (Computer networks) Algorithms Computer networks Dynamics Energy consumption Energy levels Finite element method Mobile ad hoc networks Mobile communication systems Networks Nodes Performance evaluation Residual energy Routing (telecommunications) Traffic engineering Traffic flow Wireless communication systems Wireless networks |
title | Energy-Efficient Self-Organizing Routing for Wireless Mobile Networks |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T06%3A03%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Energy-Efficient%20Self-Organizing%20Routing%20for%20Wireless%20Mobile%20Networks&rft.jtitle=International%20journal%20of%20business%20data%20communications%20and%20networking&rft.au=Moh,%20Melody&rft.date=2009-10-01&rft.volume=5&rft.issue=4&rft.spage=52&rft.epage=69&rft.pages=52-69&rft.issn=1548-0631&rft.eissn=1548-064X&rft_id=info:doi/10.4018/jbdcn.2009091704&rft_dat=%3Cgale_cross%3EA211366097%3C/gale_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c420t-80d0f6939cb78db967b148cf069362325c36c40ce7a94b85ee0959155d0202d63%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2937211279&rft_id=info:pmid/&rft_galeid=A211366097&rfr_iscdi=true |