T. Esmaeili, M. Lari, Akbari, E. Jahani, Somayeh Mohamadi
{"title":"提出了一种减少移动自组织网络路由开销的方法","authors":"T. Esmaeili, M. Lari, Akbari, E. Jahani, Somayeh Mohamadi","doi":"10.1109/ICECTECH.2010.5479965","DOIUrl":null,"url":null,"abstract":"Mobile ad hoc networks are characterized by multi-hop wireless links, absence of any cellular infrastructure, and frequent host mobility. Design of efficient routing protocols in such networks is a challenging issue. A class of routing protocols called on-demand protocols has recently found attention because of their low routing overhead. We propose a technique that can reduce the routing overhead even further. The on-demand protocols depend on query floods to discover routes whenever a new route is needed. Our approach reduces the number of broadcast packet and reduces the number of query packets in the networks to a limited region of the network to send query packets. Simulation results demonstrate excellent reduction of routing overheads with this mechanism. This also contributes to a reduced level of network congestion and better end-to-end delay performance of data packets.","PeriodicalId":178300,"journal":{"name":"2010 2nd International Conference on Electronic Computer Technology","volume":"176 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Proposing an approach for routing overhead reduction in mobile ad hoc networks\",\"authors\":\"T. Esmaeili, M. Lari, Akbari, E. Jahani, Somayeh Mohamadi\",\"doi\":\"10.1109/ICECTECH.2010.5479965\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mobile ad hoc networks are characterized by multi-hop wireless links, absence of any cellular infrastructure, and frequent host mobility. Design of efficient routing protocols in such networks is a challenging issue. A class of routing protocols called on-demand protocols has recently found attention because of their low routing overhead. We propose a technique that can reduce the routing overhead even further. The on-demand protocols depend on query floods to discover routes whenever a new route is needed. Our approach reduces the number of broadcast packet and reduces the number of query packets in the networks to a limited region of the network to send query packets. Simulation results demonstrate excellent reduction of routing overheads with this mechanism. This also contributes to a reduced level of network congestion and better end-to-end delay performance of data packets.\",\"PeriodicalId\":178300,\"journal\":{\"name\":\"2010 2nd International Conference on Electronic Computer Technology\",\"volume\":\"176 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 2nd International Conference on Electronic Computer Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICECTECH.2010.5479965\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 2nd International Conference on Electronic Computer Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECTECH.2010.5479965","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Proposing an approach for routing overhead reduction in mobile ad hoc networks
Mobile ad hoc networks are characterized by multi-hop wireless links, absence of any cellular infrastructure, and frequent host mobility. Design of efficient routing protocols in such networks is a challenging issue. A class of routing protocols called on-demand protocols has recently found attention because of their low routing overhead. We propose a technique that can reduce the routing overhead even further. The on-demand protocols depend on query floods to discover routes whenever a new route is needed. Our approach reduces the number of broadcast packet and reduces the number of query packets in the networks to a limited region of the network to send query packets. Simulation results demonstrate excellent reduction of routing overheads with this mechanism. This also contributes to a reduced level of network congestion and better end-to-end delay performance of data packets.