Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A multi-hop pointer forwarding scheme for efficient location update in low-rate wireless mesh networks
KTH, School of Engineering Sciences in Chemistry, Biotechnology and Health (CBH). School of Computing, Korea Advanced Institute of Science and Technology, Daejeon, 34141, Republic of Korea.
2018 (English)In: Journal of Parallel and Distributed Computing, ISSN 0743-7315, E-ISSN 1096-0848, Vol. 122, p. 109-121Article in journal (Refereed) Published
Abstract [en]

Recently, a pointer forwarding scheme (PFS) was proposed to reduce location update overhead in wireless mesh networks. Using PFS, a location update is replaced with a simple forwarding pointer setup between two neighboring mesh routers (MRs). However, in PFS, if the two MRs are not one hop neighbors, PFS fails to set up a forwarding pointer, thus increasing location update overhead. To improve PFS, we present a multi-hop pointer forwarding scheme (MPFS). MPFS allows forwarding pointers to be constructed over multi-hop at once even if MRs are not one hop neighbor by using logical tree distance constructed during network formation. The tree distance is used to relay forwarding pointer packets over multi-hop links without additional control overhead during forwarding pointer setup and to estimate hop distance between two MRs. By doing so, MPFS improves the probability of success in forwarding pointer setup while ensuring k≤km, resulting in lowering the location update overhead. Also, we analyze pointer forwarding success probability and average chain length and discuss why MPFS is suitable for resource-constrained LRWMNs. Using ns-2, we show that MPFS significantly reduces the number of location update events, location update delay and signaling overhead, and packet losses during location updates. With real-world implementation, we also confirm feasibility of MPFS. 

Place, publisher, year, edition, pages
Academic Press Inc. , 2018. Vol. 122, p. 109-121
Keywords [en]
6LoWPAN, Handoff, IEEE 802.15.4, Location management, Mobility management, Pointer forwarding, Wireless mesh networks, Cost reduction, Forestry, IEEE Standards, Location, Mesh generation, Packet networks, Wireless mesh networks (WMN), MESH networking
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:kth:diva-236578DOI: 10.1016/j.jpdc.2018.07.012ISI: 000448232400009Scopus ID: 2-s2.0-85051988202OAI: oai:DiVA.org:kth-236578DiVA, id: diva2:1266024
Note

Export Date: 22 October 2018; Article; CODEN: JPDCE; Correspondence Address: Kim, D.; School of Computing, Korea Advanced Institute of Science and TechnologySouth Korea; email: kimd@kaist.ac.kr. QC 20181127

Available from: 2018-11-27 Created: 2018-11-27 Last updated: 2018-11-27Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Ha, Minkeun
By organisation
School of Engineering Sciences in Chemistry, Biotechnology and Health (CBH)
In the same journal
Journal of Parallel and Distributed Computing
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 13 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf