In multiple-input multiple-output (MIMO) systems, iterative receiver with turbo processing between detection and decoding can achieve near-capacity performance. This paper introduces detection ordering into conventional soft interference cancellation minimum mean square error (SoIC-MMSE) detector which cancels the interference and detect signals in a 'parallel' manner. With soft information feedback, a novel expected error based (EEB) ordering algorithm is proposed and applied to quadrature amplitude modulation (QAM) signaling. Simulation results show that with a little complexity increase in one turbo iteration compared to the conventional SoIC-MMSE detection, our algorithm needs less iteration to achieve better performance.
{"title":"Expected Error Based MMSE Detection Ordering for Iterative Detection-Decoding MIMO Systems","authors":"Lei Zhang, Chunhui Zhou, Shidong Zhou, Xibin Xu","doi":"10.1109/WCNC.2007.242","DOIUrl":"https://doi.org/10.1109/WCNC.2007.242","url":null,"abstract":"In multiple-input multiple-output (MIMO) systems, iterative receiver with turbo processing between detection and decoding can achieve near-capacity performance. This paper introduces detection ordering into conventional soft interference cancellation minimum mean square error (SoIC-MMSE) detector which cancels the interference and detect signals in a 'parallel' manner. With soft information feedback, a novel expected error based (EEB) ordering algorithm is proposed and applied to quadrature amplitude modulation (QAM) signaling. Simulation results show that with a little complexity increase in one turbo iteration compared to the conventional SoIC-MMSE detection, our algorithm needs less iteration to achieve better performance.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131023206","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 propose a novel type-II hybrid ARQ scheme using low density parity check (LDPC) codes. The proposed approach combines low hardware overhead with good decoding performance by using an efficient decoder operating at a much higher rate with a much smaller size parity check matrix. Our scheme makes parts of the previously received data gradually improved until successful decoding of the entire original codeword. We also present a novel efficient framework for constructing rate-compatible LDPC codes applied in our hybrid ARQ scheme. The progressive edge growth (PEG) construction method with zigzag pattern results in linear-time encoding.
{"title":"A Novel Scheme for Type-II Hybrid ARQ Protocols Using LDPC Codes","authors":"Liang Chen, Xiumin Shi, Shijun Yan, Ziyu Wu, Wenjun Zhang, Yunfeng Guan","doi":"10.1109/WCNC.2007.131","DOIUrl":"https://doi.org/10.1109/WCNC.2007.131","url":null,"abstract":"In this paper, we propose a novel type-II hybrid ARQ scheme using low density parity check (LDPC) codes. The proposed approach combines low hardware overhead with good decoding performance by using an efficient decoder operating at a much higher rate with a much smaller size parity check matrix. Our scheme makes parts of the previously received data gradually improved until successful decoding of the entire original codeword. We also present a novel efficient framework for constructing rate-compatible LDPC codes applied in our hybrid ARQ scheme. The progressive edge growth (PEG) construction method with zigzag pattern results in linear-time encoding.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131214335","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}
Inter-working of existing packet switched wireless access technologies can help make services ubiquitously available. However this means that the services will have to be delivered over a heterogeneous mix of access technologies. There are several technical challenges that have to be overcome in such an environment, with selection of an optimal service delivery network being one of the most important issues. Choosing a nonoptimal network can result in problems such as the use of expensive access types or poor service experience. Multi attribute decision making (MADM) algorithms have been considered in the past to rank the candidate networks in a preference order. While many types of MADM algorithms exist, the decision maker may choose to use a particular type of algorithm to solve a decision problem based on an assessment of the suitability of the algorithm to the problem space. This paper adapts ELECTRE, a type of MADM algorithm that performs pair-wise comparisons amongst the alternatives, to solve the problem of network selection. The algorithm has been modified so that it is able to provide complete ranking of networks even in scenarios where the utility of some attributes is nonmonotonic. The algorithm has been evaluated by applying it to a network selection scenario in a heterogeneous wireless network environment.
{"title":"Application of ELECTRE to Network Selection in A Hetereogeneous Wireless Network Environment","authors":"F. Bari, Victor C. M. Leung","doi":"10.1109/WCNC.2007.697","DOIUrl":"https://doi.org/10.1109/WCNC.2007.697","url":null,"abstract":"Inter-working of existing packet switched wireless access technologies can help make services ubiquitously available. However this means that the services will have to be delivered over a heterogeneous mix of access technologies. There are several technical challenges that have to be overcome in such an environment, with selection of an optimal service delivery network being one of the most important issues. Choosing a nonoptimal network can result in problems such as the use of expensive access types or poor service experience. Multi attribute decision making (MADM) algorithms have been considered in the past to rank the candidate networks in a preference order. While many types of MADM algorithms exist, the decision maker may choose to use a particular type of algorithm to solve a decision problem based on an assessment of the suitability of the algorithm to the problem space. This paper adapts ELECTRE, a type of MADM algorithm that performs pair-wise comparisons amongst the alternatives, to solve the problem of network selection. The algorithm has been modified so that it is able to provide complete ranking of networks even in scenarios where the utility of some attributes is nonmonotonic. The algorithm has been evaluated by applying it to a network selection scenario in a heterogeneous wireless network environment.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133298599","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}
C. B. Rodríguez-Estrello, F. A. Cruz-Pérez, L. Ortigoza-Guerrero, G. Hernández-Valdez
In this paper, a new system level approach for modeling wireless channel unreliability in CDMA cellular systems is proposed. The analysis takes into account call connection types (i.e., soft handoff or single base station) and their respective link reliabilities, which according to some measurements in real cellular networks reported in the literature can adequately be modeled by considering a Poisson call interruption process. This is turn results in significant simplifications of system level analysis. Then, with the proposed interruption modeling, an elegant teletraffic analysis for the performance evaluation of mobile cellular CDMA networks considering both wireless link unreliability and resource insufficiency is developed. Realistic mobility conditions are taken into account by characterizing users' mobility parameters by means of a smooth random mobility model. Novel mathematical expressions for the new call blocking, handoff failure, and forced termination probabilities are then derived. Graph theory and Mason's rule are employed for the derivation of the forced termination probability.
{"title":"System Level Model for Wireless Channel Unreliability in CDMA Mobile Cellular Networks","authors":"C. B. Rodríguez-Estrello, F. A. Cruz-Pérez, L. Ortigoza-Guerrero, G. Hernández-Valdez","doi":"10.1109/WCNC.2007.586","DOIUrl":"https://doi.org/10.1109/WCNC.2007.586","url":null,"abstract":"In this paper, a new system level approach for modeling wireless channel unreliability in CDMA cellular systems is proposed. The analysis takes into account call connection types (i.e., soft handoff or single base station) and their respective link reliabilities, which according to some measurements in real cellular networks reported in the literature can adequately be modeled by considering a Poisson call interruption process. This is turn results in significant simplifications of system level analysis. Then, with the proposed interruption modeling, an elegant teletraffic analysis for the performance evaluation of mobile cellular CDMA networks considering both wireless link unreliability and resource insufficiency is developed. Realistic mobility conditions are taken into account by characterizing users' mobility parameters by means of a smooth random mobility model. Novel mathematical expressions for the new call blocking, handoff failure, and forced termination probabilities are then derived. Graph theory and Mason's rule are employed for the derivation of the forced termination probability.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132278525","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}
This paper proposes a novel hybrid decision-feedback equalizer (HDFE) for direct sequence code-division multiple-access (DS-CDMA) systems to improve their performance in highly time-dispersive fading environments. In the proposed scheme, despreading and re-spreading are integrated in the feedback process to improve the accuracy of feedback signals. Instead of performing chip detection to obtain the instantaneous feedback signals as in the conventional HDFE, the authors buffer the spread signals for a symbol, carry out the despreading, and then apply symbol detection to derive the feedback signals. In the feedback process, re-spreading is applied since equalization must be implemented at 'chip-level'. Through the use of symbol detection and re-spreading, more accurate feedback signals are achieved. Additionally, the proposed method effectively mitigates the effect of error propagation that may dramatically degrade the performance of conventional decision-feedback equalization schemes. Simulation results demonstrate the superior error performances of the proposed scheme over the conventional HDFE and RAKE schemes in highly dispersive channels such as those described in the recommendation ITU-M.1225 for mobile communications.
{"title":"New Hybrid Decision Feedback Equalization for DS-CDMA Systems","authors":"Le-Nam Tran, E. Hong, Huaping Liu","doi":"10.1109/WCNC.2007.96","DOIUrl":"https://doi.org/10.1109/WCNC.2007.96","url":null,"abstract":"This paper proposes a novel hybrid decision-feedback equalizer (HDFE) for direct sequence code-division multiple-access (DS-CDMA) systems to improve their performance in highly time-dispersive fading environments. In the proposed scheme, despreading and re-spreading are integrated in the feedback process to improve the accuracy of feedback signals. Instead of performing chip detection to obtain the instantaneous feedback signals as in the conventional HDFE, the authors buffer the spread signals for a symbol, carry out the despreading, and then apply symbol detection to derive the feedback signals. In the feedback process, re-spreading is applied since equalization must be implemented at 'chip-level'. Through the use of symbol detection and re-spreading, more accurate feedback signals are achieved. Additionally, the proposed method effectively mitigates the effect of error propagation that may dramatically degrade the performance of conventional decision-feedback equalization schemes. Simulation results demonstrate the superior error performances of the proposed scheme over the conventional HDFE and RAKE schemes in highly dispersive channels such as those described in the recommendation ITU-M.1225 for mobile communications.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"34 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132654482","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}
Power allocation strategies are devised to maximize the network lifetime of amplify-and-forward (AF) cooperative networks. The paper considers the scenario where one source and multiple partners cooperate to transmit messages to the destination. The powers emitted by the users are subject to the SNR requirement at the destination. First, the power allocation strategy that demands the minimum instantaneous aggregate transmit power of all cooperating partners is described and analyzed. The optimal solution results in a form of selective relaying; namely, the user with the best channel condition is selected to help in relaying the message. However, this instantaneous power minimization strategy does not necessarily maximize the lifetime of battery-limited systems. Then, three AF cooperative schemes were proposed to exploit the channel state information (CSI), the residual battery energy and the QoS requirement. It is shown that the network lifetime can be extended considerably by taking all these three factors into account.
{"title":"Lifetime Maximization for Amplify-and-Forward Cooperative Networks","authors":"Wan-Jen Huang, Y. Hong, C.-C. Jay Kuo","doi":"10.1109/WCNC.2007.155","DOIUrl":"https://doi.org/10.1109/WCNC.2007.155","url":null,"abstract":"Power allocation strategies are devised to maximize the network lifetime of amplify-and-forward (AF) cooperative networks. The paper considers the scenario where one source and multiple partners cooperate to transmit messages to the destination. The powers emitted by the users are subject to the SNR requirement at the destination. First, the power allocation strategy that demands the minimum instantaneous aggregate transmit power of all cooperating partners is described and analyzed. The optimal solution results in a form of selective relaying; namely, the user with the best channel condition is selected to help in relaying the message. However, this instantaneous power minimization strategy does not necessarily maximize the lifetime of battery-limited systems. Then, three AF cooperative schemes were proposed to exploit the channel state information (CSI), the residual battery energy and the QoS requirement. It is shown that the network lifetime can be extended considerably by taking all these three factors into account.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131442989","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}
Multi-carrier code division multiple access (MC-CDMA) was proposed to improve capacities of wireless networks. Instead of increasing the data transmission rates of wireless links, the authors propose to assign independent data streams obtained by MC-CDMA for transmitting uplink and downlink traffic separately in order to eliminate the hidden-node and exposed-node problems between cochannel BSSs in WLANs. Simulations show that our scheme can improve network throughputs by 106% in an exposed-node scenario and by 113% in a hidden-node scenario. The authors also consider the hardware and MAC requirements of our scheme under different settings of physical carrier sensing range. The authors believe this is a first paper in the literature to assign MC-CDMA generated data streams in WLANs so as to mitigate the hidden-node and exposed-node problems.
{"title":"Eliminating Inter-BSS Co-Channel Interference by MC-CDMA in WLANs","authors":"P. Ng, D. Edwards, S. Liew","doi":"10.1109/WCNC.2007.405","DOIUrl":"https://doi.org/10.1109/WCNC.2007.405","url":null,"abstract":"Multi-carrier code division multiple access (MC-CDMA) was proposed to improve capacities of wireless networks. Instead of increasing the data transmission rates of wireless links, the authors propose to assign independent data streams obtained by MC-CDMA for transmitting uplink and downlink traffic separately in order to eliminate the hidden-node and exposed-node problems between cochannel BSSs in WLANs. Simulations show that our scheme can improve network throughputs by 106% in an exposed-node scenario and by 113% in a hidden-node scenario. The authors also consider the hardware and MAC requirements of our scheme under different settings of physical carrier sensing range. The authors believe this is a first paper in the literature to assign MC-CDMA generated data streams in WLANs so as to mitigate the hidden-node and exposed-node problems.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131871173","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 communications typically feature narrow-bandwidth, error-prone and are more vulnerable than the wired counterparts. Numerous packet based stream authentication schemes are proposed for authenticating stream transmitted over erasure wireless channel. However, by fixing the packets in transmission, any packet manipulation will cause authentication failure. In this paper, we assume a more flexible scenario where a gateway, between a producer and a receiver, is able to make adaptation operations over a stream to better fit in the wireless channel. Our adaptive scheme enables packet manipulation by committing the changes, while previous schemes are simply unapplicable. We elaborate the adaptive authentication scheme based on layered structure of a video stream as well as its encoding, packing, amortizing and verifying methods in this paper. The security is analyzed in terms of authentication probability, in which higher authentication rate (95%) is achieved with less overhead per packet. The performance analysis show that our scheme reduces more than 56% of the overhead per packet compared with that of packet based schemes.
{"title":"Adaptive Stream Authentication for Wireless Multimedia Communications","authors":"Tieyan Li, Yongdong Wu","doi":"10.1109/WCNC.2007.486","DOIUrl":"https://doi.org/10.1109/WCNC.2007.486","url":null,"abstract":"Wireless communications typically feature narrow-bandwidth, error-prone and are more vulnerable than the wired counterparts. Numerous packet based stream authentication schemes are proposed for authenticating stream transmitted over erasure wireless channel. However, by fixing the packets in transmission, any packet manipulation will cause authentication failure. In this paper, we assume a more flexible scenario where a gateway, between a producer and a receiver, is able to make adaptation operations over a stream to better fit in the wireless channel. Our adaptive scheme enables packet manipulation by committing the changes, while previous schemes are simply unapplicable. We elaborate the adaptive authentication scheme based on layered structure of a video stream as well as its encoding, packing, amortizing and verifying methods in this paper. The security is analyzed in terms of authentication probability, in which higher authentication rate (95%) is achieved with less overhead per packet. The performance analysis show that our scheme reduces more than 56% of the overhead per packet compared with that of packet based schemes.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124139887","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}
E. Sakhaee, T. Taleb, A. Jamalipour, N. Kato, Y. Nemoto
Flooding-based approaches are incorporated in reactive routing protocols as the fundamental strategy for route discovery. They overtly affect traffic as the frequency of route discovery increases along with the mobility of users in a mobile ad hoc network (MANET). This paper presents a scheme for reducing overall traffic and end-to-end delay in highly MANET networks. Firstly a new routing algorithm is proposed to reduce the frequency of flood requests by elongating the link duration of the selected paths. In order to increase the path duration, non-disjoint paths are also considered. This concept is a novel approach in route discovery as previous reactive routing protocols seek only disjoint paths. Secondly another novel approach is presented to estimate the link expiration time without the need for global positioning system (GPS) devices. To prevent broadcast storms that may be intrigued during the path discovery operation, another scheme is also introduced. The basic concept behind the proposed scheme is to broadcast only specific and well-defined packets, referred to as "best packets" in the paper. The new protocol is simulated with regard to traffic overhead. Although our main aim in this paper is to reduce the net control traffic in a MANET network, there are other benefits arising from the proposed schemes, namely the increase in link duration, reduction in the end-to-end communication delay, less disruption in data flow, and fewer path setups.
{"title":"A Novel Scheme to Reduce Control Overhead and Increase Link Duration in Highly Mobile Ad Hoc Networks","authors":"E. Sakhaee, T. Taleb, A. Jamalipour, N. Kato, Y. Nemoto","doi":"10.1109/WCNC.2007.726","DOIUrl":"https://doi.org/10.1109/WCNC.2007.726","url":null,"abstract":"Flooding-based approaches are incorporated in reactive routing protocols as the fundamental strategy for route discovery. They overtly affect traffic as the frequency of route discovery increases along with the mobility of users in a mobile ad hoc network (MANET). This paper presents a scheme for reducing overall traffic and end-to-end delay in highly MANET networks. Firstly a new routing algorithm is proposed to reduce the frequency of flood requests by elongating the link duration of the selected paths. In order to increase the path duration, non-disjoint paths are also considered. This concept is a novel approach in route discovery as previous reactive routing protocols seek only disjoint paths. Secondly another novel approach is presented to estimate the link expiration time without the need for global positioning system (GPS) devices. To prevent broadcast storms that may be intrigued during the path discovery operation, another scheme is also introduced. The basic concept behind the proposed scheme is to broadcast only specific and well-defined packets, referred to as \"best packets\" in the paper. The new protocol is simulated with regard to traffic overhead. Although our main aim in this paper is to reduce the net control traffic in a MANET network, there are other benefits arising from the proposed schemes, namely the increase in link duration, reduction in the end-to-end communication delay, less disruption in data flow, and fewer path setups.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124540277","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 propose a k-coverage preserving protocol to achieve energy efficiency while ensuring the required coverage. In our protocol, we try to select a minimal active set of sensor nodes to reach energy conservation and maintain a complete area k-coverage. We model this problem as a minimum set cover problem and solve it by using a heuristic greedy algorithm. Based on the k-coverage preserving protocol, we then propose a protocol to deal with the probabilistic k-coverage requirement, in which each sensor could be assumed to be able to detect a nearby event with a certain probability. In the probabilistic k-coverage protocol, any point in the monitoring region can be sensed by at least k sensor nodes no lower than a confidence probability. Finally, we evaluate the performance of our protocols with simulations.
{"title":"Probabilistic Coverage Preserving Protocol with Energy Efficiency in Wireless Sensor Networks","authors":"J. Sheu, Huang-Fu Lin","doi":"10.1109/WCNC.2007.489","DOIUrl":"https://doi.org/10.1109/WCNC.2007.489","url":null,"abstract":"In this paper, we propose a k-coverage preserving protocol to achieve energy efficiency while ensuring the required coverage. In our protocol, we try to select a minimal active set of sensor nodes to reach energy conservation and maintain a complete area k-coverage. We model this problem as a minimum set cover problem and solve it by using a heuristic greedy algorithm. Based on the k-coverage preserving protocol, we then propose a protocol to deal with the probabilistic k-coverage requirement, in which each sensor could be assumed to be able to detect a nearby event with a certain probability. In the probabilistic k-coverage protocol, any point in the monitoring region can be sensed by at least k sensor nodes no lower than a confidence probability. Finally, we evaluate the performance of our protocols with simulations.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124572736","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
扫码关注我们
求助内容：
应助结果提醒方式：