The problem of prolonging system lifetime in wireless sensor networks (WSNs) while guaranteeing the entire coverage of the interest zone is very challenging mainly due to constraint-energy of sensors that composed these networks. In most applications, system lifetime is defined as the time elapsed until the last sensor dies. However, this evaluation should not be used in some critical applications such as intrusion detection and surveillance applications, where coverage ratio must be raised enough. Thus, to fulfill successfully the objective of deploying WSNs for these types of applications, it is often required that ratio of alive sensors should be higher than a certain value alpha-coverage. In this paper, we propose an efficient alpha-coverage scheme to maximize the ratio of alive sensors that is necessary to guarantee the entire coverage of the interest region. This scheme is based on substantial performance gains of scheduling and broad casting solutions proposed to prolong system lifetime in WSNs. Simulation results show that our scheme prolongs considerably network lifetime when compared with LEACH [1] and LEACH-C [2].
{"title":"a-Coverage Scheme for Wireless Sensor Networks","authors":"M. Lehsaini, H. Guyennet, M. Feham","doi":"10.1109/ICWMC.2008.67","DOIUrl":"https://doi.org/10.1109/ICWMC.2008.67","url":null,"abstract":"The problem of prolonging system lifetime in wireless sensor networks (WSNs) while guaranteeing the entire coverage of the interest zone is very challenging mainly due to constraint-energy of sensors that composed these networks. In most applications, system lifetime is defined as the time elapsed until the last sensor dies. However, this evaluation should not be used in some critical applications such as intrusion detection and surveillance applications, where coverage ratio must be raised enough. Thus, to fulfill successfully the objective of deploying WSNs for these types of applications, it is often required that ratio of alive sensors should be higher than a certain value alpha-coverage. In this paper, we propose an efficient alpha-coverage scheme to maximize the ratio of alive sensors that is necessary to guarantee the entire coverage of the interest region. This scheme is based on substantial performance gains of scheduling and broad casting solutions proposed to prolong system lifetime in WSNs. Simulation results show that our scheme prolongs considerably network lifetime when compared with LEACH [1] and LEACH-C [2].","PeriodicalId":308667,"journal":{"name":"2008 The Fourth International Conference on Wireless and Mobile Communications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115514198","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}
Providing QoS for nomadic hosts remains a critical issue since new emerging wireless technologies may present different behaviours in terms of QoS, security or cost. Within this heterogeneous environment, especially if a handover occurs, keeping the same QoS level for one application may require some methods to negotiate the QoS provided in each network. In this paper, we propose to adopt a proactive and dynamic negotiation approach coupled with the handover decision algorithm implemented. This method is compared to two existing solutions developed in the Daidalos IST project and in the Ambient Network IST project.
{"title":"A Novel Procedure for Coupling QoS Control and Handover Decision for Mobility Management","authors":"A. Zouari, L. Suciu, J. Bonnin, K. Guillouard","doi":"10.1109/ICWMC.2008.28","DOIUrl":"https://doi.org/10.1109/ICWMC.2008.28","url":null,"abstract":"Providing QoS for nomadic hosts remains a critical issue since new emerging wireless technologies may present different behaviours in terms of QoS, security or cost. Within this heterogeneous environment, especially if a handover occurs, keeping the same QoS level for one application may require some methods to negotiate the QoS provided in each network. In this paper, we propose to adopt a proactive and dynamic negotiation approach coupled with the handover decision algorithm implemented. This method is compared to two existing solutions developed in the Daidalos IST project and in the Ambient Network IST project.","PeriodicalId":308667,"journal":{"name":"2008 The Fourth International Conference on Wireless and Mobile Communications","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121740703","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}
D. Krstić, P. Nikolic, M. Matović, A. Matovic, M. Stefanovic
In this paper the probability density function of the SSC combiner output signal at one time instant and the joint probability density function of the SSC combiner output signal at two time instants are determined. Switch and stay combining (SSC) is considered. The presence of the Nakagami-m fading at the input is observed. The results are shown graphically for different variance values and decision threshold values.
{"title":"The Joint Probability Density Function of the SSC Combiner Output Signal in the Presence of Nakagami-m Fading","authors":"D. Krstić, P. Nikolic, M. Matović, A. Matovic, M. Stefanovic","doi":"10.1109/ICWMC.2008.75","DOIUrl":"https://doi.org/10.1109/ICWMC.2008.75","url":null,"abstract":"In this paper the probability density function of the SSC combiner output signal at one time instant and the joint probability density function of the SSC combiner output signal at two time instants are determined. Switch and stay combining (SSC) is considered. The presence of the Nakagami-m fading at the input is observed. The results are shown graphically for different variance values and decision threshold values.","PeriodicalId":308667,"journal":{"name":"2008 The Fourth International Conference on Wireless and Mobile Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131336965","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}
Cavity-backed slot (CBS) antennas are commonly used in earth-based and space-borne MIMO systems. Coupling between antennas degrades the performance of MIMO systems. Therefore, it is desirable to minimize the coupling between antennas used on MIMO systems. In this paper, the finite-difference time-domain (FDTD) method is used to analyze antenna coupling with emphasis on different methods to reduce coupling. Specifically, coupling reduction is attempted using lossy material superstrates or ground plane discontinuities, such as slits.
{"title":"Coupling Reduction for Collocated Antennas on MIMO Systems","authors":"S. Georgakopoulos","doi":"10.1109/ICWMC.2008.22","DOIUrl":"https://doi.org/10.1109/ICWMC.2008.22","url":null,"abstract":"Cavity-backed slot (CBS) antennas are commonly used in earth-based and space-borne MIMO systems. Coupling between antennas degrades the performance of MIMO systems. Therefore, it is desirable to minimize the coupling between antennas used on MIMO systems. In this paper, the finite-difference time-domain (FDTD) method is used to analyze antenna coupling with emphasis on different methods to reduce coupling. Specifically, coupling reduction is attempted using lossy material superstrates or ground plane discontinuities, such as slits.","PeriodicalId":308667,"journal":{"name":"2008 The Fourth International Conference on Wireless and Mobile Communications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134259885","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 this paper, we investigate wireless communications over multi-radio and multi-channel wireless mesh networks with IEEE 802.11e based ingress access points for local clients. We develop a theoretical model for stochastic performance analysis for real-time applications over such wireless mesh networks with wideband fading channels in various environments.
{"title":"Stochastic Performance Analysis of Multi-radio Multi-channel Wireless Mesh Networks","authors":"Chengzhi Li, Wei Zhao","doi":"10.1109/ICWMC.2008.39","DOIUrl":"https://doi.org/10.1109/ICWMC.2008.39","url":null,"abstract":"In this paper, we investigate wireless communications over multi-radio and multi-channel wireless mesh networks with IEEE 802.11e based ingress access points for local clients. We develop a theoretical model for stochastic performance analysis for real-time applications over such wireless mesh networks with wideband fading channels in various environments.","PeriodicalId":308667,"journal":{"name":"2008 The Fourth International Conference on Wireless and Mobile Communications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133857516","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}
Known for their capability of being deployed 'on the fly', and resilience to dynamically 'heal' around failed network elements, wireless mobile ad hoc networks (MANETs) are gaining widespread momentum both in the commercial and military sectors. The success of MANETs is however critically tied to the amount of network capacity available to transport a wide spectrum of applications that the MANETs are expected to transport. While capacity analysis in MANETs is in itself a challenging topic, the constraints imposed by realistic MANETs of the types envisioned in disaster areas and/or military environments complicates the analysis further. Our focus in this paper is to provide insights to the critical and challenging topic: MANET capacity analysis in networks with heterogeneous links and traffic demands. By employing formal analytic techniques, we develop a framework to assess information exchange feasibility with a focus on capacity (bandwidth) requirements. Additionally, we present a mobile ad hoc network capacity analysis tool that can be used to both design MANETs to support a given mission and analyze performance of a MANET for a specified mission.
{"title":"Mobile Ad Hoc Communication Networks: Capacity Analysis and Design","authors":"L. Kant, E. van den Berg, K. Krishnan","doi":"10.1109/ICWMC.2008.48","DOIUrl":"https://doi.org/10.1109/ICWMC.2008.48","url":null,"abstract":"Known for their capability of being deployed 'on the fly', and resilience to dynamically 'heal' around failed network elements, wireless mobile ad hoc networks (MANETs) are gaining widespread momentum both in the commercial and military sectors. The success of MANETs is however critically tied to the amount of network capacity available to transport a wide spectrum of applications that the MANETs are expected to transport. While capacity analysis in MANETs is in itself a challenging topic, the constraints imposed by realistic MANETs of the types envisioned in disaster areas and/or military environments complicates the analysis further. Our focus in this paper is to provide insights to the critical and challenging topic: MANET capacity analysis in networks with heterogeneous links and traffic demands. By employing formal analytic techniques, we develop a framework to assess information exchange feasibility with a focus on capacity (bandwidth) requirements. Additionally, we present a mobile ad hoc network capacity analysis tool that can be used to both design MANETs to support a given mission and analyze performance of a MANET for a specified mission.","PeriodicalId":308667,"journal":{"name":"2008 The Fourth International Conference on Wireless and Mobile Communications","volume":"196 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114000864","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}
Nevin Vunka Jungum, Razvi Doomun, Soulakshmee D. Ghurbhurrun, S. Pudaruth
The Bluetooth protocol can be used for inter-vehicle communication equipped with Bluetooth devices. This work investigates the challenges and feasibility of developing intelligent driving system providing time-sensitive information about traffic conditions and roadside facilities. The architecture for collaborative vehicle communication system is presented using the concepts of wireless networks and Bluetooth protocol. We discuss how vehicles can form mobile ad-hoc networks and exchange data by the on-board Bluetooth sensors. The key design concepts of the intelligent driving service infrastructure are analyzed showing collaborative fusion of multiple positional data could give a better understanding of the surrounding traffic conditions for collaborative driving. The technical feasibility of using Bluetooth for data exchange among moving vehicles is evaluated.
{"title":"Collaborative Driving Support System in Mobile Pervasive Environments","authors":"Nevin Vunka Jungum, Razvi Doomun, Soulakshmee D. Ghurbhurrun, S. Pudaruth","doi":"10.1109/ICWMC.2008.58","DOIUrl":"https://doi.org/10.1109/ICWMC.2008.58","url":null,"abstract":"The Bluetooth protocol can be used for inter-vehicle communication equipped with Bluetooth devices. This work investigates the challenges and feasibility of developing intelligent driving system providing time-sensitive information about traffic conditions and roadside facilities. The architecture for collaborative vehicle communication system is presented using the concepts of wireless networks and Bluetooth protocol. We discuss how vehicles can form mobile ad-hoc networks and exchange data by the on-board Bluetooth sensors. The key design concepts of the intelligent driving service infrastructure are analyzed showing collaborative fusion of multiple positional data could give a better understanding of the surrounding traffic conditions for collaborative driving. The technical feasibility of using Bluetooth for data exchange among moving vehicles is evaluated.","PeriodicalId":308667,"journal":{"name":"2008 The Fourth International Conference on Wireless and Mobile Communications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123946120","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 today's society digital services have become the key to the success of anyone. Hence, for being competitive it is important that these services are available, employ the latest technology and are low cost. Unfortunately, it often happens that these good intentions do not correspond to reality. In this paper an information system is proposed, targeted at those small realities affected by the digital divide and at those companies that employ out of date, high cost technologies, that provides data and voice services in a unified manner using heterogeneous devices. The system utilizes innovative technologies, in particular wireless technology, to deliver low cost solutions. The distinctive feature is that it does not depend on the network hardware infrastructure and the underlying platform. Furthermore, it deals with the configuration, accounting, security, management, and monitoring aspects while maintaining its flexibility and simplicity of use both for the administrator and end user.
{"title":"A Portable Wireless-Based Architecture for Solving Minimum Digital Divide Problems","authors":"G. Fenu, L. Piras","doi":"10.1109/ICWMC.2008.21","DOIUrl":"https://doi.org/10.1109/ICWMC.2008.21","url":null,"abstract":"In today's society digital services have become the key to the success of anyone. Hence, for being competitive it is important that these services are available, employ the latest technology and are low cost. Unfortunately, it often happens that these good intentions do not correspond to reality. In this paper an information system is proposed, targeted at those small realities affected by the digital divide and at those companies that employ out of date, high cost technologies, that provides data and voice services in a unified manner using heterogeneous devices. The system utilizes innovative technologies, in particular wireless technology, to deliver low cost solutions. The distinctive feature is that it does not depend on the network hardware infrastructure and the underlying platform. Furthermore, it deals with the configuration, accounting, security, management, and monitoring aspects while maintaining its flexibility and simplicity of use both for the administrator and end user.","PeriodicalId":308667,"journal":{"name":"2008 The Fourth International Conference on Wireless and Mobile Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128024584","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 recent years, various routing protocols have been proposed for ad hoc networks. Most of these protocols are based upon simulation and security. These protocols still lack in terms of performance efficiency of routing protocols such as avoidance of route breaking, sensing of breakage in route, security and reliability (basically authentication of mobile hops in the real ad hoc networks. i.e. during data packets transmission, if link is disconnected or lost then in place of retransmission or reestablishment of route, node/router focused on using the best available route which forwards data packets through hops/nodes). The paper presents an approach in which, each node communicates to its' surrounding nodes/routers with calculated probability, and reduces the overhead of the routing protocols. In the proposed approach, the routing tables based upon calculated probability are being maintained. This enables to select the most optimal path for transmitting the data packets by sensing the breaking of route so that it can avoid the broken route and simultaneously authenticate the hops/nodes. Routes are executed in which all nodes' communication depend on the probability and the topology of the network, i.e. it helps to detect the mobility of nodes. By using probabilistic approach, we are adding significant improvement onstandard metrics of AODV protocols. We are using a new recent modeling formalism, called the omega-calculus, which will naturally and succinctly model our proposed protocol, and is able to make the routing tables based upon probabilistic approach, sensing of neighbors, detects and maintains the table due to mobility of nodes, authentication of new nodes, and listing of broadcasts and unicast.
{"title":"A Probabilistic Based Approach to Improve the Performance and Efficiency of AODV Protocol","authors":"N. Mishra, M. Ansari, S. Tapaswi","doi":"10.1109/ICWMC.2008.14","DOIUrl":"https://doi.org/10.1109/ICWMC.2008.14","url":null,"abstract":"In recent years, various routing protocols have been proposed for ad hoc networks. Most of these protocols are based upon simulation and security. These protocols still lack in terms of performance efficiency of routing protocols such as avoidance of route breaking, sensing of breakage in route, security and reliability (basically authentication of mobile hops in the real ad hoc networks. i.e. during data packets transmission, if link is disconnected or lost then in place of retransmission or reestablishment of route, node/router focused on using the best available route which forwards data packets through hops/nodes). The paper presents an approach in which, each node communicates to its' surrounding nodes/routers with calculated probability, and reduces the overhead of the routing protocols. In the proposed approach, the routing tables based upon calculated probability are being maintained. This enables to select the most optimal path for transmitting the data packets by sensing the breaking of route so that it can avoid the broken route and simultaneously authenticate the hops/nodes. Routes are executed in which all nodes' communication depend on the probability and the topology of the network, i.e. it helps to detect the mobility of nodes. By using probabilistic approach, we are adding significant improvement onstandard metrics of AODV protocols. We are using a new recent modeling formalism, called the omega-calculus, which will naturally and succinctly model our proposed protocol, and is able to make the routing tables based upon probabilistic approach, sensing of neighbors, detects and maintains the table due to mobility of nodes, authentication of new nodes, and listing of broadcasts and unicast.","PeriodicalId":308667,"journal":{"name":"2008 The Fourth International Conference on Wireless and Mobile Communications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126383691","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 this paper, we present a very simple and efficient end to-end algorithm to handle wormhole attacks on ad hoc networks. We provide a lower bound on the minimum number of hops on a good route. Any path showing lesser hop counts is shown to be under attack. Our algorithm requires every node to know its location. With very accurate GPS available, this assumption is not unreasonable. Since our protocol does not require speed or time, we do not need clock synchronization. In the absence of any error in the location, there are no false alarms i.e. no good paths are discarded. We have shown that the effect of error in the location information is negligible. The storage and computation overhead is low. For a path of length l, it takes only O(l) space and time which is less as compared to other end-to-end algorithms like Wang etal [8]. Their algorithm uses O(lm) storage and O(lm2) computation time, where m is the number of packets examined. Since their protocol uses speed to detect wormholes, they assume the clocks to be loosely synchronized.
{"title":"SEEEP: Simple and Efficient End-to-End Protocol to Secure Ad Hoc Networks against Wormhole Attacks","authors":"S. Khurana, Neelima Gupta","doi":"10.1002/sec.272","DOIUrl":"https://doi.org/10.1002/sec.272","url":null,"abstract":"In this paper, we present a very simple and efficient end to-end algorithm to handle wormhole attacks on ad hoc networks. We provide a lower bound on the minimum number of hops on a good route. Any path showing lesser hop counts is shown to be under attack. Our algorithm requires every node to know its location. With very accurate GPS available, this assumption is not unreasonable. Since our protocol does not require speed or time, we do not need clock synchronization. In the absence of any error in the location, there are no false alarms i.e. no good paths are discarded. We have shown that the effect of error in the location information is negligible. The storage and computation overhead is low. For a path of length l, it takes only O(l) space and time which is less as compared to other end-to-end algorithms like Wang etal [8]. Their algorithm uses O(lm) storage and O(lm2) computation time, where m is the number of packets examined. Since their protocol uses speed to detect wormholes, they assume the clocks to be loosely synchronized.","PeriodicalId":308667,"journal":{"name":"2008 The Fourth International Conference on Wireless and Mobile Communications","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123454123","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
扫码关注我们
求助内容：
应助结果提醒方式：