Although topology control has been extensively studied for stationary sensor networks, few theoretical results on topology control for mobile sensor networks (MSN) have been reported yet. In this paper, we propose two O(n3) time topology control algorithms, centralized and distributed versions respectively, under a variant rate mobile network model (VRMN). In VRMN each sensor node may move at a variant speed and associated with each node is its starting and ending positions in the unit time interval. Our algorithms are proactive such that it can guarantee the topology of a given instance of MSN can continuously connected in the unit time interval, regardless of how much the moving speeds of the sensor nodes are. Extensive simulations have been conducted and the simulation results reveal that the resultant topology after applying our distributed topology control algorithm shows good performances in terms of average transmission radius and connectivity.
{"title":"Energy Efficient Topology Control Algorithms for Variant Rate Mobile Sensor Networks","authors":"Jianbo Li, Liusheng Huang, Mingjun Xiao","doi":"10.1109/MSN.2008.16","DOIUrl":"https://doi.org/10.1109/MSN.2008.16","url":null,"abstract":"Although topology control has been extensively studied for stationary sensor networks, few theoretical results on topology control for mobile sensor networks (MSN) have been reported yet. In this paper, we propose two O(n3) time topology control algorithms, centralized and distributed versions respectively, under a variant rate mobile network model (VRMN). In VRMN each sensor node may move at a variant speed and associated with each node is its starting and ending positions in the unit time interval. Our algorithms are proactive such that it can guarantee the topology of a given instance of MSN can continuously connected in the unit time interval, regardless of how much the moving speeds of the sensor nodes are. Extensive simulations have been conducted and the simulation results reveal that the resultant topology after applying our distributed topology control algorithm shows good performances in terms of average transmission radius and connectivity.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"74 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132398784","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}
A multimetric QoS routing protocol (MQOLSR) is proposed in this paper, which providing different QoS for different applications flow in an ad hoc network. The protocol, which integrates QoS measurement and packet forwarding, expands the topology discovery and routing computing mechanism of the OLSR protocol. It can provide different routing and forwarding service according to different application flow. The experimental results show that the MQOLSR protocol improves the network performance. Compared to the traditional OLSR protocol, the proposed routing protocol increases network throughput by 31.8% and reduces delay jitter when transmitting IPTV, while its routing overhead and routing discovery time are within an acceptable range.
{"title":"A Multi-metric QoS Routing Method for Ad Hoc Network","authors":"Jing Cao, Wei Wu","doi":"10.1109/MSN.2008.25","DOIUrl":"https://doi.org/10.1109/MSN.2008.25","url":null,"abstract":"A multimetric QoS routing protocol (MQOLSR) is proposed in this paper, which providing different QoS for different applications flow in an ad hoc network. The protocol, which integrates QoS measurement and packet forwarding, expands the topology discovery and routing computing mechanism of the OLSR protocol. It can provide different routing and forwarding service according to different application flow. The experimental results show that the MQOLSR protocol improves the network performance. Compared to the traditional OLSR protocol, the proposed routing protocol increases network throughput by 31.8% and reduces delay jitter when transmitting IPTV, while its routing overhead and routing discovery time are within an acceptable range.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"154 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132785771","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}
Zhuguo Li, Hongbin Li, Fan Zhang, Jiming Chen, Youxian Sun
Wireless sensor and actuator networks (WSAN) are increasingly popular due to their abilities to detect and react to interesting events in the physical world. In this paper, a new indoor WSAN system in the context of pursuit evasion games (PEGs) is designed and implemented. Our goal is to take advantage of the WSAN capabilities to perform target tracking and capture. We design the system control model, and present the detailed implementation of the WSAN, in particular the distributed evader tracking, pursuer control components and the system/user interfaces. We also present algorithms used to achieve low cost, low energy consumption, and robustness of performance in the WSAN. Experiments demonstrate that the pursuer captures the evader successfully in all the runs. Our work provides practical solutions for designing and implementing a working WSAN for PEG tasks.
{"title":"An Indoor Sensor Network System for Pursuit-Evasion Games","authors":"Zhuguo Li, Hongbin Li, Fan Zhang, Jiming Chen, Youxian Sun","doi":"10.1109/MSN.2008.32","DOIUrl":"https://doi.org/10.1109/MSN.2008.32","url":null,"abstract":"Wireless sensor and actuator networks (WSAN) are increasingly popular due to their abilities to detect and react to interesting events in the physical world. In this paper, a new indoor WSAN system in the context of pursuit evasion games (PEGs) is designed and implemented. Our goal is to take advantage of the WSAN capabilities to perform target tracking and capture. We design the system control model, and present the detailed implementation of the WSAN, in particular the distributed evader tracking, pursuer control components and the system/user interfaces. We also present algorithms used to achieve low cost, low energy consumption, and robustness of performance in the WSAN. Experiments demonstrate that the pursuer captures the evader successfully in all the runs. Our work provides practical solutions for designing and implementing a working WSAN for PEG tasks.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116718489","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}
It is important to analyze link status changes in mobile ad hoc networks (MANETs) since the wireless channel is affected by multiple sources of interference. Scalability is a major research topic in the development of MANET routing algorithms, since the network resource of MANET is limited due to the contention-based wireless communication channel. This paper proposes to adopt a dominant pruning (DP) algorithm, instead of using the conventional blind flooding in AAPs, to reduce the broadcasting redundancy in MANET address auto-configuration protocol (AAP) in the status of link change. A novel method to enable AAP to attain routing capability, by suggesting new messages, is proposed. Simulation demonstrates that the performance improves when the conventional AAPs such as Strong DAD, Weak duplicate address detection (DAD) with proactive routing protocols (WDP), Weak DAD with on demand routing protocols (WDO) and MANET conf are replaced with the proposed algorithms.
{"title":"Analysis of Link Error in Reducing Broadcasting Redundancy of MANET AAPs","authors":"Sang-Chul Kim","doi":"10.1109/MSN.2008.47","DOIUrl":"https://doi.org/10.1109/MSN.2008.47","url":null,"abstract":"It is important to analyze link status changes in mobile ad hoc networks (MANETs) since the wireless channel is affected by multiple sources of interference. Scalability is a major research topic in the development of MANET routing algorithms, since the network resource of MANET is limited due to the contention-based wireless communication channel. This paper proposes to adopt a dominant pruning (DP) algorithm, instead of using the conventional blind flooding in AAPs, to reduce the broadcasting redundancy in MANET address auto-configuration protocol (AAP) in the status of link change. A novel method to enable AAP to attain routing capability, by suggesting new messages, is proposed. Simulation demonstrates that the performance improves when the conventional AAPs such as Strong DAD, Weak duplicate address detection (DAD) with proactive routing protocols (WDP), Weak DAD with on demand routing protocols (WDO) and MANET conf are replaced with the proposed algorithms.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125105472","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}
Sensor deployment is a key issue in target detection. While a lot of works have been done to achieve "physical coverage'', few work addresses meeting high detection accuracy presented as a specific high detection probability and a low false alarm rate. In this paper, we employ a data-fusion based collaborative detection scheme for achieving guaranteed accuracy in sensor deployment. A "density first'' clustering algorithm is adopt to organize preselected surveillance locations into deployment units, place sensors to cover these locations from the intensive region to sparse one. The simulation results show that our deployment algorithm can significantly reduce total number of deployed sensors with guaranteed accuracy compare with the previous works.
{"title":"Sensor Deployment Strategy for Collaborative Target Detection with Guaranteed Accuracy","authors":"Zhaohui Yuan, Gaofeng Wang","doi":"10.1109/MSN.2008.14","DOIUrl":"https://doi.org/10.1109/MSN.2008.14","url":null,"abstract":"Sensor deployment is a key issue in target detection. While a lot of works have been done to achieve \"physical coverage'', few work addresses meeting high detection accuracy presented as a specific high detection probability and a low false alarm rate. In this paper, we employ a data-fusion based collaborative detection scheme for achieving guaranteed accuracy in sensor deployment. A \"density first'' clustering algorithm is adopt to organize preselected surveillance locations into deployment units, place sensors to cover these locations from the intensive region to sparse one. The simulation results show that our deployment algorithm can significantly reduce total number of deployed sensors with guaranteed accuracy compare with the previous works.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131125762","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}
We consider an ad-hoc network consisting of devices that try to gain access for transmission through a shared radio communication channel. We consider two randomized leader election protocols the first one is due to Nakanoand Olariu (2000); the second one is due to Cai, Lu and Wang (2003) and propose combinations which give us an improvement of both of them. We show that with discrete starting points of transmission, between which a station may choose in a non-uniform way, leads to a simple algorithm that substantially outperforms the previous techniques of resolving channel access problems. We provide methods to optimize values of parameters used.
{"title":"Power of Discrete Nonuniformity - Optimizing Access to Shared Radio Channel in Ad Hoc Networks","authors":"J. Cichon, Mirosław Kutyłowski, M. Zawada","doi":"10.1109/MSN.2008.48","DOIUrl":"https://doi.org/10.1109/MSN.2008.48","url":null,"abstract":"We consider an ad-hoc network consisting of devices that try to gain access for transmission through a shared radio communication channel. We consider two randomized leader election protocols the first one is due to Nakanoand Olariu (2000); the second one is due to Cai, Lu and Wang (2003) and propose combinations which give us an improvement of both of them. We show that with discrete starting points of transmission, between which a station may choose in a non-uniform way, leads to a simple algorithm that substantially outperforms the previous techniques of resolving channel access problems. We provide methods to optimize values of parameters used.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132629412","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}
Mobile nodes in some challenging network scenarios suffer from intermittent connectivity and frequent partitions e.g. battlefield and disaster recovery scenarios. Disruption tolerant network (DTN) technologies are designed to enable nodes in such environments to communicate with one another. In the past, we have proposed two intradomain multicast routing schemes, namely the context-aware multicast routing (CAMR) and encounter-based multicast routing (EBMR) schemes. In this paper, we consider the problem of routing multicast messages across different domains. We present a ferry based interdomain multicast delivery scheme where a ferry is used to deliver multicast messages across groups that are partitioned and a variant of the encounter-based multicast routing scheme is used as the intradomain routing scheme for intradomain delivery. We then present simulation results using different group mobility models to illustrate the usefulness of the scheme we design. Our results indicate that the scheme we design can achieve high delivery ratio with reasonable data efficiency. Our results also indicate that the delivery ratio seen using a more realistic VANET model is slightly worse than that seen using the RPGM model.
{"title":"Efficient Interdomain Multicast Delivery in Disruption Tolerant Networks","authors":"P. Yang, M. Chuah","doi":"10.1109/MSN.2008.9","DOIUrl":"https://doi.org/10.1109/MSN.2008.9","url":null,"abstract":"Mobile nodes in some challenging network scenarios suffer from intermittent connectivity and frequent partitions e.g. battlefield and disaster recovery scenarios. Disruption tolerant network (DTN) technologies are designed to enable nodes in such environments to communicate with one another. In the past, we have proposed two intradomain multicast routing schemes, namely the context-aware multicast routing (CAMR) and encounter-based multicast routing (EBMR) schemes. In this paper, we consider the problem of routing multicast messages across different domains. We present a ferry based interdomain multicast delivery scheme where a ferry is used to deliver multicast messages across groups that are partitioned and a variant of the encounter-based multicast routing scheme is used as the intradomain routing scheme for intradomain delivery. We then present simulation results using different group mobility models to illustrate the usefulness of the scheme we design. Our results indicate that the scheme we design can achieve high delivery ratio with reasonable data efficiency. Our results also indicate that the delivery ratio seen using a more realistic VANET model is slightly worse than that seen using the RPGM model.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"919 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133038774","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}
Qingfeng Fan, F. Magoulès, Qiongli Wu, Yanxiang He
For attained high data multicast efficiency for the P2P database system, the paper proposes a set of novel multicast algorithms. In contrast with the current algorithms, the new algorithms firstly divide the group members into different clusters in terms of static delay distance, then find the central node in the clusters, calculate the space weight of every node, search the data quantity of every node, and find the maximal data quantity node. After obtaining the spatial weight vector and the data quantity weight vector, the algorithms try to find a new vector composed by linear combination of the spatial and data weight vectors. Then the algorithms build binary simple equations between them, seek linear modulus and generate a least weight path tree, namely multicast tree. The multicast tree is then constructed by using the new algorithms. Extended simulation results indicate that these new algorithms are more suitable for P2P Database compared with other well-known existing multicast solutions.
{"title":"Linear Optimal Hierarchical Multicast Tree Algorithms for P2P Database","authors":"Qingfeng Fan, F. Magoulès, Qiongli Wu, Yanxiang He","doi":"10.1109/MSN.2008.36","DOIUrl":"https://doi.org/10.1109/MSN.2008.36","url":null,"abstract":"For attained high data multicast efficiency for the P2P database system, the paper proposes a set of novel multicast algorithms. In contrast with the current algorithms, the new algorithms firstly divide the group members into different clusters in terms of static delay distance, then find the central node in the clusters, calculate the space weight of every node, search the data quantity of every node, and find the maximal data quantity node. After obtaining the spatial weight vector and the data quantity weight vector, the algorithms try to find a new vector composed by linear combination of the spatial and data weight vectors. Then the algorithms build binary simple equations between them, seek linear modulus and generate a least weight path tree, namely multicast tree. The multicast tree is then constructed by using the new algorithms. Extended simulation results indicate that these new algorithms are more suitable for P2P Database compared with other well-known existing multicast solutions.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133862831","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}
The trend toward high processing power at a reasonable cost continues with the emergence of multi-core architectures with large number of cores. In such computing systems, a major technological challenge is to design the internal, on-chip communication network.This not only depends on high performance in latency, bandwidth, and fairness in contention under heavy loads, but also depends on an efficient authentication mechanism and protection of integrity and privacy of applications from hardware and software attacks. In this paper, we present a technique to establish secret keys for the cores employed by the same application to communicate securely. Our approach is based on key pre-distribution, in which each of the cores chooses a number of keys from a large key pool. When a group of cores are employed by an application, they discover their shared keys and establish a group key for secured communication. The key discovery and the process to connect partitioned groups use space-efficient Bloom filter to ensure the security and efficiency of the key establishment process. Our performance evaluation demonstrates the efficiency of the proposed framework.
{"title":"Key Establishment in Multi-core Parallel Systems","authors":"Meikang Qiu, Jing Deng","doi":"10.1109/MSN.2008.45","DOIUrl":"https://doi.org/10.1109/MSN.2008.45","url":null,"abstract":"The trend toward high processing power at a reasonable cost continues with the emergence of multi-core architectures with large number of cores. In such computing systems, a major technological challenge is to design the internal, on-chip communication network.This not only depends on high performance in latency, bandwidth, and fairness in contention under heavy loads, but also depends on an efficient authentication mechanism and protection of integrity and privacy of applications from hardware and software attacks. In this paper, we present a technique to establish secret keys for the cores employed by the same application to communicate securely. Our approach is based on key pre-distribution, in which each of the cores chooses a number of keys from a large key pool. When a group of cores are employed by an application, they discover their shared keys and establish a group key for secured communication. The key discovery and the process to connect partitioned groups use space-efficient Bloom filter to ensure the security and efficiency of the key establishment process. Our performance evaluation demonstrates the efficiency of the proposed framework.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121212114","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}
Wireless interference can make a significant impact on the performance of a wireless network. The paper studies TDMA-based timeslot allocation to schedule links efficiently under RTS/CTS interference model of wireless networks, and presents an efficient centralized timeslot assignment algorithm. In addition, the paper presents an effective heuristic algorithm for calculating end-to-end bandwidth on a path, which is used together with AODV to setup QoS routes. Simulation results show that compared with the shortest path routing, our interference-aware QoS routing algorithm increases success ratio of finding a route with required bandwidth to destination node.
{"title":"Interference-Aware QoS Routing in Wireless Mesh Networks","authors":"Zhen Xu, Chuanhe Huang, Yong Cheng","doi":"10.1109/MSN.2008.29","DOIUrl":"https://doi.org/10.1109/MSN.2008.29","url":null,"abstract":"Wireless interference can make a significant impact on the performance of a wireless network. The paper studies TDMA-based timeslot allocation to schedule links efficiently under RTS/CTS interference model of wireless networks, and presents an efficient centralized timeslot assignment algorithm. In addition, the paper presents an effective heuristic algorithm for calculating end-to-end bandwidth on a path, which is used together with AODV to setup QoS routes. Simulation results show that compared with the shortest path routing, our interference-aware QoS routing algorithm increases success ratio of finding a route with required bandwidth to destination node.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121347118","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
扫码关注我们
求助内容：
应助结果提醒方式：