{"id":{"repo_id":"anu","oai_identifier":"oai:openresearch-repository.anu.edu.au:1885/49272"},"canonical_url":"https://search.dev.ndltd.org/etd/anu/oai:openresearch-repository.anu.edu.au:1885/49272","repository":{"repo_id":"anu","name":"Australian National University","base_url":"https://openresearch-repository.anu.edu.au/server/oai/request"},"display":{"title":"Mobility Metrics for Routing in MANETs","abstract":"A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without the need for base stations or any other pre–existing network infrastructure. In a peer-to-peer fashion, mobile nodes can communicate with each other by using wireless multihop communication. Due to its low cost, high flexibility, fast network establishment and self-reconfiguration, ad hoc networking has received much interest during the last ten years. However, without a fixed infrastructure, frequent path changes cause significant numbers of routing packets to discover new paths, leading to increased network congestion and transmission latency over fixed networks. Many on-demand routing protocols have been developed by using various routing mobility metrics to choose the most reliable routes, while dealing with the primary obstacle caused by node mobility. ¶ In the first part, we have developed an analysis framework for mobility metrics in random mobility model. ... ¶ In the second part, we investigate the mobility metric applications on caching strategies and hierarchy routing algorithm. ...","abstract_html":"A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without the need for base stations or any other pre–existing network infrastructure. In a peer-to-peer fashion, mobile nodes can communicate with each other by using wireless multihop communication. Due to its low cost, high flexibility, fast network establishment and self-reconfiguration, ad hoc networking has received much interest during the last ten years. However, without a fixed infrastructure, frequent path changes cause significant numbers of routing packets to discover new paths, leading to increased network congestion and transmission latency over fixed networks. Many on-demand routing protocols have been developed by using various routing mobility metrics to choose the most reliable routes, while dealing with the primary obstacle caused by node mobility. ¶ In the first part, we have developed an analysis framework for mobility metrics in random mobility model. ... ¶ In the second part, we investigate the mobility metric applications on caching strategies and hierarchy routing algorithm. ...","abstract_has_math":false,"creators":["Xu, Sanlin"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2007,"date_issued":"2007","date_published":"2007","updated_at":"2026-07-24T00:55:04Z","subjects":["MANETs, mobile ad hoc networks, mobility metrics, Markov chain model, route caching, link caching, cache timeout, minimum routing overhead, hierarchy routing, k-hop clustering, clusterhead selectionmetric, optimal cluster density"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["b23042205"],"render_values":[{"text":"b23042205","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/1885/49272","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Xu, Sanlin"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2010-02-08T04:09:53Z","2011-01-04T02:35:48Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2010-02-08T04:09:53Z","2011-01-04T02:35:48Z"]},{"key":"dc:date.issued","label":"Date","values":["2007"]},{"key":"dc:type","label":"Dc Type","values":["Thesis (PhD)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["MANETs, mobile ad hoc networks, mobility metrics, Markov chain model, route caching, link caching, cache timeout, minimum routing overhead, hierarchy routing, k-hop clustering, clusterhead selectionmetric, optimal cluster density"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]},{"key":"dc:rights.uri","label":"Rights URI","values":["The Australian National University"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["b23042205"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1885/49272"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without the need for base stations or any other pre–existing network infrastructure. In a peer-to-peer fashion, mobile nodes can communicate with each other by using wireless multihop communication. Due to its low cost, high flexibility, fast network establishment and self-reconfiguration, ad hoc networking has received much interest during the last ten years. However, without a fixed infrastructure, frequent path changes cause significant numbers of routing packets to discover new paths, leading to increased network congestion and transmission latency over fixed networks. Many on-demand routing protocols have been developed by using various routing mobility metrics to choose the most reliable routes, while dealing with the primary obstacle caused by node mobility. ¶ In the first part, we have developed an analysis framework for mobility metrics in random mobility model. ... ¶ In the second part, we investigate the mobility metric applications on caching strategies and hierarchy routing algorithm. ..."]},{"key":"dc:title","label":"Title","values":["Mobility Metrics for Routing in MANETs"]}]}],"canonical_facts":{"dc:creator":["Xu, Sanlin"],"dc:date.accessioned":["2010-02-08T04:09:53Z","2011-01-04T02:35:48Z"],"dc:date.available":["2010-02-08T04:09:53Z","2011-01-04T02:35:48Z"],"dc:date.issued":["2007"],"dc:description.abstract":["A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without the need for base stations or any other pre–existing network infrastructure. In a peer-to-peer fashion, mobile nodes can communicate with each other by using wireless multihop communication. Due to its low cost, high flexibility, fast network establishment and self-reconfiguration, ad hoc networking has received much interest during the last ten years. However, without a fixed infrastructure, frequent path changes cause significant numbers of routing packets to discover new paths, leading to increased network congestion and transmission latency over fixed networks. Many on-demand routing protocols have been developed by using various routing mobility metrics to choose the most reliable routes, while dealing with the primary obstacle caused by node mobility. ¶ In the first part, we have developed an analysis framework for mobility metrics in random mobility model. ... ¶ In the second part, we investigate the mobility metric applications on caching strategies and hierarchy routing algorithm. ..."],"dc:identifier.other":["b23042205"],"dc:identifier.uri":["http://hdl.handle.net/1885/49272"],"dc:language.iso":["en"],"dc:rights.uri":["The Australian National University"],"dc:subject":["MANETs, mobile ad hoc networks, mobility metrics, Markov chain model, route caching, link caching, cache timeout, minimum routing overhead, hierarchy routing, k-hop clustering, clusterhead selectionmetric, optimal cluster density"],"dc:title":["Mobility Metrics for Routing in MANETs"],"dc:type":["Thesis (PhD)"]},"updated_at":"2026-07-24T00:55:04Z"}