Adversaries can easily launch an attack, by taking advantage of the free wireless networking available to the public at many conferences, airports or cafes. Meanwhile in these environments, it is very difficult to identify the adversaries. In this paper, we present a scheme that is designed to defend against potential attacks at a very early stage, in order to minimize the damage to the victims and the entire network. Instead of taking actions only after the attacks arrive at the host, our scheme makes the access point the one who monitors, identifies and prevents potential attacks. In this active protection way, the system can respond more quickly and can also prevent much of the malicious network traffic.
{"title":"Active Protection in Wireless Networking","authors":"Ming Lei, Yang Xiao, Susan V. Vrbsky","doi":"10.1109/MSN.2008.33","DOIUrl":"https://doi.org/10.1109/MSN.2008.33","url":null,"abstract":"Adversaries can easily launch an attack, by taking advantage of the free wireless networking available to the public at many conferences, airports or cafes. Meanwhile in these environments, it is very difficult to identify the adversaries. In this paper, we present a scheme that is designed to defend against potential attacks at a very early stage, in order to minimize the damage to the victims and the entire network. Instead of taking actions only after the attacks arrive at the host, our scheme makes the access point the one who monitors, identifies and prevents potential attacks. In this active protection way, the system can respond more quickly and can also prevent much of the malicious network traffic.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"18 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":"129361672","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 proved that multipoint relaying (MPR) is an efficient strategy for on-the-fly broadcasting in mobile ad hoc networks . Upon receiving a flooding packet, each relaying node designated by the packet selects nodes from its neighbors for next packet relay. All the selected relaying nodes finally form a connected dominating set (CDS) for the network. However, computing a minimum size CDS is NP hard. Several existing algorithms use the idea of MPR to reduce the size of the CDS. In this paper, we observed two drawbacks in the existing algorithms and proposed a new greedy algorithm based on node connectivity. Also, a connectivity based rule based on the new greedy algorithm is proposed to reduce the CDS size of Wupsilas EMPR . Both theoretical analysis and experiment results show that the new greedy algorithm outperforms the existing broadcasting algorithms in the terms of number of relaying nodes.
{"title":"Connectivity Based Greedy Algorithm with Multipoint Relaying for Mobile Ad Hoc Networks","authors":"Y. Fu, Xinyu Wang, Wei Shi, Shanping Li","doi":"10.1109/MSN.2008.15","DOIUrl":"https://doi.org/10.1109/MSN.2008.15","url":null,"abstract":"It is proved that multipoint relaying (MPR) is an efficient strategy for on-the-fly broadcasting in mobile ad hoc networks . Upon receiving a flooding packet, each relaying node designated by the packet selects nodes from its neighbors for next packet relay. All the selected relaying nodes finally form a connected dominating set (CDS) for the network. However, computing a minimum size CDS is NP hard. Several existing algorithms use the idea of MPR to reduce the size of the CDS. In this paper, we observed two drawbacks in the existing algorithms and proposed a new greedy algorithm based on node connectivity. Also, a connectivity based rule based on the new greedy algorithm is proposed to reduce the CDS size of Wupsilas EMPR . Both theoretical analysis and experiment results show that the new greedy algorithm outperforms the existing broadcasting algorithms in the terms of number of relaying nodes.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"70 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":"127361281","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}
Seungki Hong, Yeon-Jun Choi, Yang Yu, Loren J. Rittle
Reprogramming over the network is an essential requirement in large-scale, long term wireless sensor network deployments. In this paper, we present LACONIC, a history-based code dissemination technique, for programmable wireless sensor networks supporting multiple applications. In order to attain network traffic abatement and timely code delivery, LACONIC exploits (1) application calling history and (2) code dissemination history. The application calling history is modeled by a Application Call Graph(ACG) which represents the calling relationships among multiple applications. Second, the code dissemination history as a set of observed previous code forwarding paths indicates previous code forwarding path of the associated application in the context of the application calling history. Therefore, the code request triggered by a requester is reached to the responder by traveling along the path, not being consecutively flooded. Using a flooding-based existing code dissemination work as the baseline, we show the effectiveness of Laconic in terms of network traffic and time delay through both probability model-based analysis and simulation results.
{"title":"LACONIC: History-Based Code Dissemination in Programmable Wireless Sensor Networks","authors":"Seungki Hong, Yeon-Jun Choi, Yang Yu, Loren J. Rittle","doi":"10.1109/MSN.2008.46","DOIUrl":"https://doi.org/10.1109/MSN.2008.46","url":null,"abstract":"Reprogramming over the network is an essential requirement in large-scale, long term wireless sensor network deployments. In this paper, we present LACONIC, a history-based code dissemination technique, for programmable wireless sensor networks supporting multiple applications. In order to attain network traffic abatement and timely code delivery, LACONIC exploits (1) application calling history and (2) code dissemination history. The application calling history is modeled by a Application Call Graph(ACG) which represents the calling relationships among multiple applications. Second, the code dissemination history as a set of observed previous code forwarding paths indicates previous code forwarding path of the associated application in the context of the application calling history. Therefore, the code request triggered by a requester is reached to the responder by traveling along the path, not being consecutively flooded. Using a flooding-based existing code dissemination work as the baseline, we show the effectiveness of Laconic in terms of network traffic and time delay through both probability model-based analysis and simulation results.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"1 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":"126143762","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 next generation of mobile/wireless communication system is expected to include heterogeneous broadband wireless networks that will coexist and use a common IP core to offer a diverse range of high data rate multimedia services to end users with contemporary mobile devices. The mobile devices will be equipped with multiple network interfaces since the networks have characteristics that complement each other. This requires the provision of seamless vertical handover. In this paper, a probability driven handover scheme which uses the mobile's speed (SPHO) is developed to support seamless and adaptive handover management between WLAN and UMTS. Extensive simulation experiments show that this scheme effectively achieves seamless handover between heterogeneous networks and guarantees quality of communication during handover.
{"title":"Speed-Based Probability-Driven Seamless Handover Scheme between WLAN and UMTS","authors":"Zhiwei Yan, Huachun Zhou, Hongke Zhang, Sidong Zhang","doi":"10.1109/MSN.2008.26","DOIUrl":"https://doi.org/10.1109/MSN.2008.26","url":null,"abstract":"The next generation of mobile/wireless communication system is expected to include heterogeneous broadband wireless networks that will coexist and use a common IP core to offer a diverse range of high data rate multimedia services to end users with contemporary mobile devices. The mobile devices will be equipped with multiple network interfaces since the networks have characteristics that complement each other. This requires the provision of seamless vertical handover. In this paper, a probability driven handover scheme which uses the mobile's speed (SPHO) is developed to support seamless and adaptive handover management between WLAN and UMTS. Extensive simulation experiments show that this scheme effectively achieves seamless handover between heterogeneous networks and guarantees quality of communication during handover.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"78 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":"122430697","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}
Based on the analysis of the node selfishness and the drawback of min-hop selection method as the unique routing selection criteria in ad hoc networks, a non-intrusive multi-metric ad hoc routing protocol-NIMR is presented. By computing and storing the node fame, NIMR greatly attenuates the influence of node selfishness; By crossing-design between MAC layer and network layer, we employ a non-intrusive real-time available bandwidth measurement scheme to solve the congestion problem. Finally, we propose a new metric as the routing selection criteria, which combines fame, available bandwidth and minimum hops by weight. Simulation results show, Compared with DSR, fairness between nodes is improved and congestion control and load balance is implemented using NIMR without additionally increasing the network load. At the same time average life-span and end-to-end throughput is increased, average end-to-end delay is decreased using NIMR.
{"title":"A Congestion Avoidance and Performance Enhancement Scheme for Mobile Ad Hoc Networks","authors":"Chen Chen, Qingqi Pei, Jianfeng Ma","doi":"10.1109/MSN.2008.51","DOIUrl":"https://doi.org/10.1109/MSN.2008.51","url":null,"abstract":"Based on the analysis of the node selfishness and the drawback of min-hop selection method as the unique routing selection criteria in ad hoc networks, a non-intrusive multi-metric ad hoc routing protocol-NIMR is presented. By computing and storing the node fame, NIMR greatly attenuates the influence of node selfishness; By crossing-design between MAC layer and network layer, we employ a non-intrusive real-time available bandwidth measurement scheme to solve the congestion problem. Finally, we propose a new metric as the routing selection criteria, which combines fame, available bandwidth and minimum hops by weight. Simulation results show, Compared with DSR, fairness between nodes is improved and congestion control and load balance is implemented using NIMR without additionally increasing the network load. At the same time average life-span and end-to-end throughput is increased, average end-to-end delay is decreased using NIMR.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"67 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":"134086382","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 traditional networking builds on layered protocol architecture to isolate the complexities in different layers. It has been realized that real-life wireless sensor networks (WSNs) must be considered holistically across different layers for optimum performance. We consider a special case of WSNs that is deployed in underground tunnels. Underground communications present unique signal propagation characteristics due to the geographic and geological features, which in turn impact the underground network deployment and multi-hop routing patterns. We propose an efficient routing algorithm, called BRIT (bounce routing in tunnels), for underground WSNs, and evaluate BRIT against the bottomline AODV in terms of network throughput, packet loss rate, stability and latencies using simulations. The contributions of the paper include a hybrid signal propagation model in three dimentional underground tunnels, an assortment of sensor deployment strategies in tunnels, an integrated routing metric (forwarding speed), and a route suppression mechanism.
{"title":"A Holistic Routing Protocol Design in Underground Wireless Sensor Networks","authors":"Di Wu, Renfa Li, L. Bao","doi":"10.1109/MSN.2008.41","DOIUrl":"https://doi.org/10.1109/MSN.2008.41","url":null,"abstract":"The traditional networking builds on layered protocol architecture to isolate the complexities in different layers. It has been realized that real-life wireless sensor networks (WSNs) must be considered holistically across different layers for optimum performance. We consider a special case of WSNs that is deployed in underground tunnels. Underground communications present unique signal propagation characteristics due to the geographic and geological features, which in turn impact the underground network deployment and multi-hop routing patterns. We propose an efficient routing algorithm, called BRIT (bounce routing in tunnels), for underground WSNs, and evaluate BRIT against the bottomline AODV in terms of network throughput, packet loss rate, stability and latencies using simulations. The contributions of the paper include a hybrid signal propagation model in three dimentional underground tunnels, an assortment of sensor deployment strategies in tunnels, an integrated routing metric (forwarding speed), and a route suppression mechanism.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"49 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":"133476362","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 series of environmental disasters have aroused peoplepsilas attention to the issue of diffusing-event monitoring through sensor networks. In this paper, a geography-aware fume-diffusion-spotting sensor network is investigated based on the hull theory, giving inspiration for a suite of similar diffusion-monitoring applications. In our approach, the energy consumption and the event coverage rate are tested, with the results showing notable advantage compared to the conventional random method. The experiments also indicate that the density of the network has little influence on the performance of our approach, inferring that our approach can be extended to meet the needs of network deployment in various real-world conditions.
{"title":"Geography-Aware Fume Diffusion Spotting in Sensor Networks","authors":"Xiaoning Cui, Qing Li, Bao-hua Zhao","doi":"10.1109/MSN.2008.30","DOIUrl":"https://doi.org/10.1109/MSN.2008.30","url":null,"abstract":"A series of environmental disasters have aroused peoplepsilas attention to the issue of diffusing-event monitoring through sensor networks. In this paper, a geography-aware fume-diffusion-spotting sensor network is investigated based on the hull theory, giving inspiration for a suite of similar diffusion-monitoring applications. In our approach, the energy consumption and the event coverage rate are tested, with the results showing notable advantage compared to the conventional random method. The experiments also indicate that the density of the network has little influence on the performance of our approach, inferring that our approach can be extended to meet the needs of network deployment in various real-world conditions.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"158 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":"132735046","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 critical problem in wireless sensor networks is to maximize their lifetimes. Data aggregation is an effective method to reduce redundant data and minimize the overall energy consumption. This method requires data to be delayed and processed in their paths to the sink node, so it causes extra time delay to the networks. This paper studies the aggregation node selection problem in sensor networks with time delay constraint, and the objective is to minimize the overall energy consumption of networks. A dynamic programming algorithm is proposed to solve the problem. This algorithm can turn out the optimal solution in polynomial time. Extensive simulations have been conducted to evaluate the performance of the proposed algorithm; the results show the efficiency of the algorithm in energy consumption reduction.
{"title":"Optimal Selection of Aggregation Nodes in Sensor Networks with Time Delay Constraint","authors":"Bo-guang Sun, Suixiang Gao, Zhipeng Jiang","doi":"10.1109/MSN.2008.18","DOIUrl":"https://doi.org/10.1109/MSN.2008.18","url":null,"abstract":"A critical problem in wireless sensor networks is to maximize their lifetimes. Data aggregation is an effective method to reduce redundant data and minimize the overall energy consumption. This method requires data to be delayed and processed in their paths to the sink node, so it causes extra time delay to the networks. This paper studies the aggregation node selection problem in sensor networks with time delay constraint, and the objective is to minimize the overall energy consumption of networks. A dynamic programming algorithm is proposed to solve the problem. This algorithm can turn out the optimal solution in polynomial time. Extensive simulations have been conducted to evaluate the performance of the proposed algorithm; the results show the efficiency of the algorithm in energy consumption reduction.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"279 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":"133583490","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}
In unattended or hostile environment like battlefield, sensor nodes may be compromised. If one node is compromised, group key which is shared by all the group members should be rekeyed in real-time and the compromised nodes should be revoked as soon as possible. As there is no such node that can always be trusted in sensor network, a distributed group rekeying scheme with speedy compromised node revocation is proposed in this paper. Based on a novelly constructed authentication polynomial, group rekeying is initiated by local network collaboratively in our scheme. Compared with the existing schemes, the proposed scheme can not only rekey in real-time, but reduce more communication overheads and provide a high level of security at the same time.
{"title":"A Distributed Lightweight Group Rekeying Scheme with Speedy Node Revocation for Wireless Sensor Networks","authors":"Zeng Wei-ni, Lin Ya-ping, Liu Yong-he","doi":"10.1109/MSN.2008.39","DOIUrl":"https://doi.org/10.1109/MSN.2008.39","url":null,"abstract":"In unattended or hostile environment like battlefield, sensor nodes may be compromised. If one node is compromised, group key which is shared by all the group members should be rekeyed in real-time and the compromised nodes should be revoked as soon as possible. As there is no such node that can always be trusted in sensor network, a distributed group rekeying scheme with speedy compromised node revocation is proposed in this paper. Based on a novelly constructed authentication polynomial, group rekeying is initiated by local network collaboratively in our scheme. Compared with the existing schemes, the proposed scheme can not only rekey in real-time, but reduce more communication overheads and provide a high level of security at the same time.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"40 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":"114717673","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}
More and more users or applications showed high interest in obtaining moving object locations from a wireless sensor network. However, a moving object usually updates its location very frequently, and thus, a great number of messages for updating the locations in the wireless sensor networks are incurred. In this paper, we propose an index structure, called the gossip-enabled spatial index tree (GSI-tree), to support efficient communication for location updates. Our idea is to utilize the gossip property of the sensor communication to let the neighboring paths of the GSI-tree share the transmitted message. In this way, the nodes managing a past location can deregister the object location independently by hearing the registration messages from the neighboring nodes.
{"title":"A Gossip-Enabled Spatial Index for Moving Object Management over Wireless Sensor Networks","authors":"Chao-Chun Chen, Chiang Lee, Yen-Liang Liu","doi":"10.1109/MSN.2008.19","DOIUrl":"https://doi.org/10.1109/MSN.2008.19","url":null,"abstract":"More and more users or applications showed high interest in obtaining moving object locations from a wireless sensor network. However, a moving object usually updates its location very frequently, and thus, a great number of messages for updating the locations in the wireless sensor networks are incurred. In this paper, we propose an index structure, called the gossip-enabled spatial index tree (GSI-tree), to support efficient communication for location updates. Our idea is to utilize the gossip property of the sensor communication to let the neighboring paths of the GSI-tree share the transmitted message. In this way, the nodes managing a past location can deregister the object location independently by hearing the registration messages from the neighboring nodes.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"10 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":"125379995","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
扫码关注我们
求助内容：
应助结果提醒方式：