Pub Date : 2018-10-04DOI: 10.1504/IJMNDI.2018.10015837
M. Vijayalakshmi, D. Rao
Mobile ad hoc network contains small infrastructure and easy communication by the aid of self configuring network. The multicasting is one of the significant elements which are used to convey the similar data from one basis to numerous targets. So, it encompasses a variety of troubles whereas conveying data such as node failure, delay, high energy utilisation, and so on. Therefore, we proposed an enhanced differential evolution cuckoo search routing protocol (EDE-CS) to construct the consistent communication in multicasting. This multicasting network is the mixture of two optimisation algorithms such as differential evolution and cuckoo search optimisation algorithm. The clustering is involved in our method for reliable transmission of packet using differential evolution algorithm and the cuckoo search found the best route path on transmitting the messages efficiently. The NS2 is a simulation tool which gives the consequence of our proposed method by comparing with the existing protocol. Therefore, it obviously illustrates that the proposed protocol of EDE-CS gives more effectiveness when compared with other existing protocols.
{"title":"QoS aware multicasting using the enhanced differential evolution cuckoo search routing protocol in MANET","authors":"M. Vijayalakshmi, D. Rao","doi":"10.1504/IJMNDI.2018.10015837","DOIUrl":"https://doi.org/10.1504/IJMNDI.2018.10015837","url":null,"abstract":"Mobile ad hoc network contains small infrastructure and easy communication by the aid of self configuring network. The multicasting is one of the significant elements which are used to convey the similar data from one basis to numerous targets. So, it encompasses a variety of troubles whereas conveying data such as node failure, delay, high energy utilisation, and so on. Therefore, we proposed an enhanced differential evolution cuckoo search routing protocol (EDE-CS) to construct the consistent communication in multicasting. This multicasting network is the mixture of two optimisation algorithms such as differential evolution and cuckoo search optimisation algorithm. The clustering is involved in our method for reliable transmission of packet using differential evolution algorithm and the cuckoo search found the best route path on transmitting the messages efficiently. The NS2 is a simulation tool which gives the consequence of our proposed method by comparing with the existing protocol. Therefore, it obviously illustrates that the proposed protocol of EDE-CS gives more effectiveness when compared with other existing protocols.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"15 1","pages":"215"},"PeriodicalIF":0.0,"publicationDate":"2018-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72843248","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 : 2018-10-04DOI: 10.1504/IJMNDI.2018.10015845
A. Kumar, S. Mohideen
The hybrid wireless network has developed as a promising solution, enabling mobile customers to accomplish higher execution and access service in a consistent way free of their reality in the range of wireless local area network (WLAN). In this paper, we have proposed the load aware routing protocol for the hybrid wireless network. Hybrid networks were having the combination of several networks such as MANET and VANET. In the hybrid network generally, the data transmission is very high and hence, it is necessary to create a reliable routing protocol for avoiding delay and to increase packet delivery ratio. Thus, we have implemented the optimal algorithm of MOEAD/D, i.e., a multi objective evolutionary algorithm based on decomposition combined with Djikstra. Here the MOEAD is used to find the best router for transmitting the data packets and the Djikstra algorithm is used to find the shortest path for the router. Thus, this combination of MOEAD and Djikstra has yielded a reliable load aware routing protocol. The simulation result shows that the performance of our proposed routing protocol is better than the existing protocol.
{"title":"Efficient load aware evolutionary routing protocol in hybrid wireless network using MOEAD/D","authors":"A. Kumar, S. Mohideen","doi":"10.1504/IJMNDI.2018.10015845","DOIUrl":"https://doi.org/10.1504/IJMNDI.2018.10015845","url":null,"abstract":"The hybrid wireless network has developed as a promising solution, enabling mobile customers to accomplish higher execution and access service in a consistent way free of their reality in the range of wireless local area network (WLAN). In this paper, we have proposed the load aware routing protocol for the hybrid wireless network. Hybrid networks were having the combination of several networks such as MANET and VANET. In the hybrid network generally, the data transmission is very high and hence, it is necessary to create a reliable routing protocol for avoiding delay and to increase packet delivery ratio. Thus, we have implemented the optimal algorithm of MOEAD/D, i.e., a multi objective evolutionary algorithm based on decomposition combined with Djikstra. Here the MOEAD is used to find the best router for transmitting the data packets and the Djikstra algorithm is used to find the shortest path for the router. Thus, this combination of MOEAD and Djikstra has yielded a reliable load aware routing protocol. The simulation result shows that the performance of our proposed routing protocol is better than the existing protocol.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"133 1","pages":"243"},"PeriodicalIF":0.0,"publicationDate":"2018-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79192405","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 : 2018-10-04DOI: 10.1504/IJMNDI.2018.10015834
S. R. M. Krishna, M. N. Ramanath, V. K. Prasad
In mobile ad hoc network (MANETs) judgment in optimal reliable routing path between source and destination is a challenging task because of the mobility nature of nodes and is deficient in the infrastructure of the network which is so dynamic. So the objective of this paper is to identify optimal reliable ordered routing paths between source and destination nodes in MANET. To meet the above challenging task the paper focus on a hybrid algorithm, this combines particle swarm optimisation (PSO) and genetic algorithm (GA) also defied PSO-GA. Motivation of hybrid approach is combining the advantage of these both algorithms. As shown, the performance obtained by the proposed approach is best compare to existing methods.
{"title":"Optimal reliable routing path selection in MANET through hybrid PSO-GA optimisation algorithm","authors":"S. R. M. Krishna, M. N. Ramanath, V. K. Prasad","doi":"10.1504/IJMNDI.2018.10015834","DOIUrl":"https://doi.org/10.1504/IJMNDI.2018.10015834","url":null,"abstract":"In mobile ad hoc network (MANETs) judgment in optimal reliable routing path between source and destination is a challenging task because of the mobility nature of nodes and is deficient in the infrastructure of the network which is so dynamic. So the objective of this paper is to identify optimal reliable ordered routing paths between source and destination nodes in MANET. To meet the above challenging task the paper focus on a hybrid algorithm, this combines particle swarm optimisation (PSO) and genetic algorithm (GA) also defied PSO-GA. Motivation of hybrid approach is combining the advantage of these both algorithms. As shown, the performance obtained by the proposed approach is best compare to existing methods.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"14 1","pages":"195"},"PeriodicalIF":0.0,"publicationDate":"2018-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82224683","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 : 2018-10-04DOI: 10.1504/IJMNDI.2018.10015838
K. Kumar, V. C. Patil
An ad hoc wireless system is an accumulation of self-ruling nodes or terminals that interacts with each other by framing a multi-hop radio system and keeps connectivity in a decentralised way. This implies that it can maintain the system promptly without the need of framework organisation. In spite, there has been a developing enthusiasm for mobile ad hoc networks as the method for giving sudden links to a group of nodes. The energy requirement of a portable node is typically a battery and the battery depletion is one of the real constraints behind the node failure. Entire mobile nodes may not be inside the transmission range of each other thus they need to interact with multi-hop approach. The loss of a unique node can incredibly influence the entire execution of the system. Thus, to utilise the constrained energy source viably and to maximise the life time of the system numerous energy effective routing protocols have been proposed for MANETs that in turn utilise diverse applications to preserve energy. Here it aims to improve the accuracy of performance evaluation therefore it is required to consider the evaluation of protocols at different layers which leads to better energy solutions. The present research will focus on evaluating performance of energy efficient protocols at different layers.
{"title":"A survey paper on performance evaluation of energy efficient protocols for wireless MANETs - a layered perspective","authors":"K. Kumar, V. C. Patil","doi":"10.1504/IJMNDI.2018.10015838","DOIUrl":"https://doi.org/10.1504/IJMNDI.2018.10015838","url":null,"abstract":"An ad hoc wireless system is an accumulation of self-ruling nodes or terminals that interacts with each other by framing a multi-hop radio system and keeps connectivity in a decentralised way. This implies that it can maintain the system promptly without the need of framework organisation. In spite, there has been a developing enthusiasm for mobile ad hoc networks as the method for giving sudden links to a group of nodes. The energy requirement of a portable node is typically a battery and the battery depletion is one of the real constraints behind the node failure. Entire mobile nodes may not be inside the transmission range of each other thus they need to interact with multi-hop approach. The loss of a unique node can incredibly influence the entire execution of the system. Thus, to utilise the constrained energy source viably and to maximise the life time of the system numerous energy effective routing protocols have been proposed for MANETs that in turn utilise diverse applications to preserve energy. Here it aims to improve the accuracy of performance evaluation therefore it is required to consider the evaluation of protocols at different layers which leads to better energy solutions. The present research will focus on evaluating performance of energy efficient protocols at different layers.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"37 1","pages":"256"},"PeriodicalIF":0.0,"publicationDate":"2018-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77250304","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 : 2018-08-02DOI: 10.1504/IJMNDI.2018.10014840
A. Priyadharshini, M. Sundarambal
In our proposed system, the vehicular sensor network (VSN) is formulated based on the cognitive radio with the aid of optimal link state routing (OLSR) protocol. Here the cognitive radio related vehicular sensor networks are anticipated for the data communication. The optimal link state routing protocol is modified by utilising the hybrid group search and genetic algorithm (HGSO-GA) algorithm. The OLSR protocol is used to pick the adjacent nodes which disseminate the power package to diminish the quantity of control transparency in the network. The data packages are conveyed from source to destination with the help of multi point relay (MPR) vehicles, which is the subset of the chosen neighbour vehicles by each source to access all the two-hop neighbours act as forwarders. OLSR routing protocol to efficiently manage spectrum allocation that helps reduce the routing delay. The proposed technique is implemented in the working platform of NS2.
{"title":"OLSR protocol for vehicular sensor network in cognitive radio","authors":"A. Priyadharshini, M. Sundarambal","doi":"10.1504/IJMNDI.2018.10014840","DOIUrl":"https://doi.org/10.1504/IJMNDI.2018.10014840","url":null,"abstract":"In our proposed system, the vehicular sensor network (VSN) is formulated based on the cognitive radio with the aid of optimal link state routing (OLSR) protocol. Here the cognitive radio related vehicular sensor networks are anticipated for the data communication. The optimal link state routing protocol is modified by utilising the hybrid group search and genetic algorithm (HGSO-GA) algorithm. The OLSR protocol is used to pick the adjacent nodes which disseminate the power package to diminish the quantity of control transparency in the network. The data packages are conveyed from source to destination with the help of multi point relay (MPR) vehicles, which is the subset of the chosen neighbour vehicles by each source to access all the two-hop neighbours act as forwarders. OLSR routing protocol to efficiently manage spectrum allocation that helps reduce the routing delay. The proposed technique is implemented in the working platform of NS2.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"2 1","pages":"168"},"PeriodicalIF":0.0,"publicationDate":"2018-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87064311","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 : 2018-08-02DOI: 10.1504/IJMNDI.2018.10014836
Dong Wang, Xiaonan Wang, Qi Sun
This paper proposes a novel formation scheme for an IEEE 802.15.4 wireless sensor network which is organised into a tree topology. This scheme consists of the network formation initialisation algorithm and the network formation maintenance algorithm. In the initialisation algorithm, each node first calculate the lengths of routing paths reaching all other nodes in the network, and then the node with the minimum path length is elected as a root. In this way, the average length of the routing paths is reduced and accordingly the routing delay is also shortened. After the initialisation algorithm is executed, the maintenance algorithm is performed to maintain the tree topology. When the tree topology changes, the maintenance algorithm can dynamically adjust the root in order to reduce the average length of the routing paths and shorten the routing delay. This scheme employs beacons to achieve the initialisation algorithm and the maintenance algorithm, so the extra costs and delays are avoided. This scheme is analysed and evaluated, and the data results show that this scheme effectively reduces the average length of the routing paths and shortens the routing delay.
{"title":"A novel formation scheme for IEEE 802.15.4 WSN","authors":"Dong Wang, Xiaonan Wang, Qi Sun","doi":"10.1504/IJMNDI.2018.10014836","DOIUrl":"https://doi.org/10.1504/IJMNDI.2018.10014836","url":null,"abstract":"This paper proposes a novel formation scheme for an IEEE 802.15.4 wireless sensor network which is organised into a tree topology. This scheme consists of the network formation initialisation algorithm and the network formation maintenance algorithm. In the initialisation algorithm, each node first calculate the lengths of routing paths reaching all other nodes in the network, and then the node with the minimum path length is elected as a root. In this way, the average length of the routing paths is reduced and accordingly the routing delay is also shortened. After the initialisation algorithm is executed, the maintenance algorithm is performed to maintain the tree topology. When the tree topology changes, the maintenance algorithm can dynamically adjust the root in order to reduce the average length of the routing paths and shorten the routing delay. This scheme employs beacons to achieve the initialisation algorithm and the maintenance algorithm, so the extra costs and delays are avoided. This scheme is analysed and evaluated, and the data results show that this scheme effectively reduces the average length of the routing paths and shortens the routing delay.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"556 1","pages":"127"},"PeriodicalIF":0.0,"publicationDate":"2018-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78923647","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 : 2018-08-02DOI: 10.1504/IJMNDI.2018.10014839
J. B. Abdo, Rabih Jreish, J. Demerjian
Mobile communication paradigm has shifted from a closed network of transmitters and receivers to an access network transporting what the content providers have to offer. Many existing and future applications offer the same content to most, if not all, clients. These applications include crowdsensing, news, and traffic monitoring portals. Mobile operators would largely benefit if such applications use multicast messages instead of unicast. Multicast communication suits such applications, but in some scenarios its efficiency can drop to reach that of unicast. In this work, we will propose a mechanism to optimise the allocation of radio resources when used for multicast, thus offering the mobile operator an opportunity to increase profit without affecting user satisfaction. The performance of the proposed mechanism is measured for various simulation scenarios.
{"title":"Extended optimisation mechanism for radio resource allocation in multicast mobile networks","authors":"J. B. Abdo, Rabih Jreish, J. Demerjian","doi":"10.1504/IJMNDI.2018.10014839","DOIUrl":"https://doi.org/10.1504/IJMNDI.2018.10014839","url":null,"abstract":"Mobile communication paradigm has shifted from a closed network of transmitters and receivers to an access network transporting what the content providers have to offer. Many existing and future applications offer the same content to most, if not all, clients. These applications include crowdsensing, news, and traffic monitoring portals. Mobile operators would largely benefit if such applications use multicast messages instead of unicast. Multicast communication suits such applications, but in some scenarios its efficiency can drop to reach that of unicast. In this work, we will propose a mechanism to optimise the allocation of radio resources when used for multicast, thus offering the mobile operator an opportunity to increase profit without affecting user satisfaction. The performance of the proposed mechanism is measured for various simulation scenarios.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"31 1","pages":"157"},"PeriodicalIF":0.0,"publicationDate":"2018-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88282515","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 : 2018-08-02DOI: 10.1504/ijmndi.2018.10014838
Tibin Mathew Thekkil, N. Prabakaran
Wireless sensor networks (WSNs) are used for many research works, in particular the framework of processing observation and examination work. Though, it contains many divergence optimisation conditions, such as the network's energy indulgence, packet-loss rate, reporting and duration. Manipulating an innovative wireless sensor node is tremendously demanding mission and entail reviewing a quantity of dissimilar limitation necessary through the objective function. This study examined completely 70 thesis are gathered from standard publications such as IEEE and Science Direct. Each thesis encompasses a variety of process among a variety of procedure, set of rules and optimisations methods. The classification derived from remote sensing scheme, dissimilar protocols, optimisation, and expenditure study progression. The entire distributed works are verified by the WSN among different atmosphere. Presentation study of this review reflects on the eminence limitation like PDR, NLT, AEED, service expenditure, and recognition exactness of dissimilar study documents. Therefore our thesis facilitates to extend new technologies over the WSN among optimisation system.
{"title":"A comparative analysis of quality parameters in wireless sensor network with different techniques: a survey","authors":"Tibin Mathew Thekkil, N. Prabakaran","doi":"10.1504/ijmndi.2018.10014838","DOIUrl":"https://doi.org/10.1504/ijmndi.2018.10014838","url":null,"abstract":"Wireless sensor networks (WSNs) are used for many research works, in particular the framework of processing observation and examination work. Though, it contains many divergence optimisation conditions, such as the network's energy indulgence, packet-loss rate, reporting and duration. Manipulating an innovative wireless sensor node is tremendously demanding mission and entail reviewing a quantity of dissimilar limitation necessary through the objective function. This study examined completely 70 thesis are gathered from standard publications such as IEEE and Science Direct. Each thesis encompasses a variety of process among a variety of procedure, set of rules and optimisations methods. The classification derived from remote sensing scheme, dissimilar protocols, optimisation, and expenditure study progression. The entire distributed works are verified by the WSN among different atmosphere. Presentation study of this review reflects on the eminence limitation like PDR, NLT, AEED, service expenditure, and recognition exactness of dissimilar study documents. Therefore our thesis facilitates to extend new technologies over the WSN among optimisation system.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"13 1","pages":"141"},"PeriodicalIF":0.0,"publicationDate":"2018-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83460029","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 : 2018-08-02DOI: 10.1504/IJMNDI.2018.10014841
M. Sumathi, G. Anitha
Wireless sensor network (WSN) is one of the emerging areas which are extensively being used for development of real time monitoring systems. Landslides are the major cause of loss of life, human settlements, agriculture, forestland, and lead to damage of communication routes. In this paper, we propose new landslide monitoring system with maximising the life time of sensor nodes by avoiding link failure in routing protocol. The cluster-based routing protocol with the sensor nodes is capable of data acquisition, data storage, data processing, and wireless data transmission. Then, collected data's are aggregated using fuzzy data mining technique which maximise lifetime of all sensor nodes in the network area. The proposed approach is implemented and results are obtained through NS-2 simulation shows that the proposed algorithm performs better than other landslide monitoring systems in terms of network life time, sensor node life time, data transmission and energy consumption.
{"title":"Energy efficient wireless sensor network with efficient data handling for real time landslide monitoring system using fuzzy data mining technique","authors":"M. Sumathi, G. Anitha","doi":"10.1504/IJMNDI.2018.10014841","DOIUrl":"https://doi.org/10.1504/IJMNDI.2018.10014841","url":null,"abstract":"Wireless sensor network (WSN) is one of the emerging areas which are extensively being used for development of real time monitoring systems. Landslides are the major cause of loss of life, human settlements, agriculture, forestland, and lead to damage of communication routes. In this paper, we propose new landslide monitoring system with maximising the life time of sensor nodes by avoiding link failure in routing protocol. The cluster-based routing protocol with the sensor nodes is capable of data acquisition, data storage, data processing, and wireless data transmission. Then, collected data's are aggregated using fuzzy data mining technique which maximise lifetime of all sensor nodes in the network area. The proposed approach is implemented and results are obtained through NS-2 simulation shows that the proposed algorithm performs better than other landslide monitoring systems in terms of network life time, sensor node life time, data transmission and energy consumption.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"30 1","pages":"179"},"PeriodicalIF":0.0,"publicationDate":"2018-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85662469","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 : 2018-06-18DOI: 10.1504/IJMNDI.2018.10013511
N. Meghanathan
We propose to quantify the neighbourhood stability of a node without using the location and mobility information of the nodes in a mobile sensor network (MSN). We make use of the notion of Jaccard similarity to quantify the similarity in the sets of neighbours of a node between any two successive sampling time instants and compute the weighted average of the Jaccard neighbourhood similarity (WJNS) over a period of time. Our hypothesis is that nodes with larger WJNS scores have a stable neighbourhood and could be preferred for inclusion as intermediate nodes for stable paths. We validate our hypothesis through extensive simulations: The lifetime of the WJNS-based paths is significantly larger than that of the minimum hop paths and the predicted link expiration time (LET)-based paths; the trade-off being a marginal increase in the hop count compared to that of the minimum hop paths.
{"title":"A location and mobility independent scheme to quantify the neighbourhood stability of a node in mobile sensor networks","authors":"N. Meghanathan","doi":"10.1504/IJMNDI.2018.10013511","DOIUrl":"https://doi.org/10.1504/IJMNDI.2018.10013511","url":null,"abstract":"We propose to quantify the neighbourhood stability of a node without using the location and mobility information of the nodes in a mobile sensor network (MSN). We make use of the notion of Jaccard similarity to quantify the similarity in the sets of neighbours of a node between any two successive sampling time instants and compute the weighted average of the Jaccard neighbourhood similarity (WJNS) over a period of time. Our hypothesis is that nodes with larger WJNS scores have a stable neighbourhood and could be preferred for inclusion as intermediate nodes for stable paths. We validate our hypothesis through extensive simulations: The lifetime of the WJNS-based paths is significantly larger than that of the minimum hop paths and the predicted link expiration time (LET)-based paths; the trade-off being a marginal increase in the hop count compared to that of the minimum hop paths.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"111 1","pages":"111"},"PeriodicalIF":0.0,"publicationDate":"2018-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87909018","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
扫码关注我们
求助内容：
应助结果提醒方式：