Pub Date : 2012-05-01DOI: 10.1201/9781420013825-19
GulatiMandeep Kaur, KumarKrishan
In mobile ad hoc networks, Quality of Service (QoS) routing is a challenging issue due to several factors like node mobility, multi-path communication and channel access. QoS guarantees are require...
{"title":"QoS routing protocols for mobile ad hoc networks","authors":"GulatiMandeep Kaur, KumarKrishan","doi":"10.1201/9781420013825-19","DOIUrl":"https://doi.org/10.1201/9781420013825-19","url":null,"abstract":"In mobile ad hoc networks, Quality of Service (QoS) routing is a challenging issue due to several factors like node mobility, multi-path communication and channel access. QoS guarantees are require...","PeriodicalId":53709,"journal":{"name":"International Journal of Wireless and Mobile Computing","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2012-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"65960578","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-12-01DOI: 10.1504/IJWMC.2011.044116
Zhang Yi, Liu Yan-chun
In this paper, some improvements on Ant Colony Optimisation (ACO) are presented and we use the improved algorithm to solve the multicast routing problem. The improvements are given as follows: A novel optimised implementing approach is designed to reduce the processing costs (the bandwidth, delay, mincost) involved with routing of ants in the conventional ACO. Based on the model of network routing, the set of candidates is limited to the nearest c points in order to reduce the counting of other points. And we also use the flags on the blocked points in order to prevent selecting these points. Simulations show that the speed of convergence of the improved algorithm can be enhanced greatly compared with the traditional algorithm.
{"title":"An improved ant colony optimisation and its application on multicast routing problem","authors":"Zhang Yi, Liu Yan-chun","doi":"10.1504/IJWMC.2011.044116","DOIUrl":"https://doi.org/10.1504/IJWMC.2011.044116","url":null,"abstract":"In this paper, some improvements on Ant Colony Optimisation (ACO) are presented and we use the improved algorithm to solve the multicast routing problem. The improvements are given as follows: A novel optimised implementing approach is designed to reduce the processing costs (the bandwidth, delay, mincost) involved with routing of ants in the conventional ACO. Based on the model of network routing, the set of candidates is limited to the nearest c points in order to reduce the counting of other points. And we also use the flags on the blocked points in order to prevent selecting these points. Simulations show that the speed of convergence of the improved algorithm can be enhanced greatly compared with the traditional algorithm.","PeriodicalId":53709,"journal":{"name":"International Journal of Wireless and Mobile Computing","volume":"5 1","pages":"18-23"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1504/IJWMC.2011.044116","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66705230","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-10-01DOI: 10.1504/IJWMC.2009.028894
Khatib Mounis, M. Abdallah, Afifi Hossam
Securing ad-hoc networks is a challenging task owing to their specific characteristics. One of the major challenges is that ad-hoc networks typically lack a fixed infrastructure, both in the form of physical nodes such as routers, servers and stable communication links, and in the form of an organisational or administrative infrastructure. Thus new nodes can join and leave the network at any time, which appeals to an efficient and flexible trust establishment mechanism. We propose in this paper an efficient protocol for key management in ad-hoc networks relying on the routing mechanism itself, which reduces efficiently the overhead and provides better performances.
{"title":"An on-demand key establishment protocol for MANETs","authors":"Khatib Mounis, M. Abdallah, Afifi Hossam","doi":"10.1504/IJWMC.2009.028894","DOIUrl":"https://doi.org/10.1504/IJWMC.2009.028894","url":null,"abstract":"Securing ad-hoc networks is a challenging task owing to their specific characteristics. One of the major challenges is that ad-hoc networks typically lack a fixed infrastructure, both in the form of physical nodes such as routers, servers and stable communication links, and in the form of an organisational or administrative infrastructure. Thus new nodes can join and leave the network at any time, which appeals to an efficient and flexible trust establishment mechanism. We propose in this paper an efficient protocol for key management in ad-hoc networks relying on the routing mechanism itself, which reduces efficiently the overhead and provides better performances.","PeriodicalId":53709,"journal":{"name":"International Journal of Wireless and Mobile Computing","volume":"1 1","pages":"123-132"},"PeriodicalIF":0.0,"publicationDate":"2009-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1504/IJWMC.2009.028894","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66705215","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1504/ijwmc.2022.10058309
Meng Jia, Ye Zhang
{"title":"Study of adaptive clutter suppression method used for airborne forward-looking wind shear radar","authors":"Meng Jia, Ye Zhang","doi":"10.1504/ijwmc.2022.10058309","DOIUrl":"https://doi.org/10.1504/ijwmc.2022.10058309","url":null,"abstract":"","PeriodicalId":53709,"journal":{"name":"International Journal of Wireless and Mobile Computing","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66705500","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：