Pub Date : 2012-06-10DOI: 10.1109/ICC.2012.6364678
T. Oliveira, S. Mahadevan, D. Agrawal
Integration of various wireless access technologies have pushed the evolution of mobile clients (MC) to be equipped with multiple interfaces for simultaneously accessing different network technologies. In these heterogeneous wireless networks (HWNs), MCs (and the underlying network) must be able to quickly and dynamically adapt to varying network conditions so as to satisfy required communication constraints. However, unlike their machine counterparts, MCs tend to have very vague and uncertain demands. This paper focuses on imprecise and dynamic nature of the MC's demands, while fulfilling multiple - often contradicting - constraints. The problem of uncertain decision making is considered by utilizing techniques from the multiple criteria decision making area. At each MC, an enhanced minimization of maximal regret (MMR) ranks available network interfaces and this maps imprecise user constraints to ranked interfaces.
{"title":"Using minimization of maximal regret for interface selection in a heterogeneous wireless network","authors":"T. Oliveira, S. Mahadevan, D. Agrawal","doi":"10.1109/ICC.2012.6364678","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364678","url":null,"abstract":"Integration of various wireless access technologies have pushed the evolution of mobile clients (MC) to be equipped with multiple interfaces for simultaneously accessing different network technologies. In these heterogeneous wireless networks (HWNs), MCs (and the underlying network) must be able to quickly and dynamically adapt to varying network conditions so as to satisfy required communication constraints. However, unlike their machine counterparts, MCs tend to have very vague and uncertain demands. This paper focuses on imprecise and dynamic nature of the MC's demands, while fulfilling multiple - often contradicting - constraints. The problem of uncertain decision making is considered by utilizing techniques from the multiple criteria decision making area. At each MC, an enhanced minimization of maximal regret (MMR) ranks available network interfaces and this maps imprecise user constraints to ranked interfaces.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127479727","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-10DOI: 10.1109/ICC.2012.6364753
L. Ahumada, R. Feick, R. Valenzuela, Manuel Gallardo, M. Derpich, H. Carrasco
We present empirical results on the achievable gains stemming from the use of wireless remote radio heads (RRH) in a typical urban environment. Our work is based on simultaneous path-loss measurements of the base station and RRH links to outdoor street level users. We statistically characterize the increase in received power, when a RRH is added to improve the coverage achieved by a base station. We consider diverse expected coverage areas for the mobile terminal, evaluating the effect of RRH position with respect to the intended users. We also compare the power gains that would be obtained in practice from combining the signals from the base with those of the RRH, using schemes such as selection combining and maximum ratio combining. We conclude that under practical conditions, the benefits of using RRHs will depend very strongly on the existence of line-of-sight links between the RRH and the intended users. For RRHs placed at low heights, below the clutter, only users in a street-canyon position with respect to the RRH will obtain a significant benefit. Our data also shows that the gains in signal-to-noise ratio achieved when using maximum ratio combining are only marginally better than those of the much simpler selection combining.
{"title":"Empirical gains achievable with low altitude remote radio heads in wireless urban links","authors":"L. Ahumada, R. Feick, R. Valenzuela, Manuel Gallardo, M. Derpich, H. Carrasco","doi":"10.1109/ICC.2012.6364753","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364753","url":null,"abstract":"We present empirical results on the achievable gains stemming from the use of wireless remote radio heads (RRH) in a typical urban environment. Our work is based on simultaneous path-loss measurements of the base station and RRH links to outdoor street level users. We statistically characterize the increase in received power, when a RRH is added to improve the coverage achieved by a base station. We consider diverse expected coverage areas for the mobile terminal, evaluating the effect of RRH position with respect to the intended users. We also compare the power gains that would be obtained in practice from combining the signals from the base with those of the RRH, using schemes such as selection combining and maximum ratio combining. We conclude that under practical conditions, the benefits of using RRHs will depend very strongly on the existence of line-of-sight links between the RRH and the intended users. For RRHs placed at low heights, below the clutter, only users in a street-canyon position with respect to the RRH will obtain a significant benefit. Our data also shows that the gains in signal-to-noise ratio achieved when using maximum ratio combining are only marginally better than those of the much simpler selection combining.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127511260","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-10DOI: 10.1109/ICC.2012.6364467
Fatih Senel, M. Younis
Due to harsh environmental conditions a Wireless Sensor Network (WSN) may suffer from large scale damage where many nodes fail simultaneously and thus the network gets partitioned into several disjoint network segments. Restoring intersegment connectivity is essential to avoid negative effects on the application. Employing mobile data collectors (MDCs), which by repositioning-facilitate the establishment of communication links between segments, may provide flexible solution to this problem. However the problem of finding shortest tours for MDCs is NP-Hard. In this paper we study the problem under constrained number of MDCs which makes the problem more challenging. We present a polynomial time heuristic for Interconnecting Disjoint Segments with k MDCs (IDM-kMDC). IDM-kMDC opts to minimize the tour lengths and balance the load on the k available MDCs. We model each segment by a representative. The IDM-kMDC heuristic finds k-subsets of representatives, computes an optimized tour for each subset and assigns one MDC for each tour. The performance of the algorithm is validated through simulation.
{"title":"Optimized interconnection of disjoint wireless sensor network segments using K mobile data collectors","authors":"Fatih Senel, M. Younis","doi":"10.1109/ICC.2012.6364467","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364467","url":null,"abstract":"Due to harsh environmental conditions a Wireless Sensor Network (WSN) may suffer from large scale damage where many nodes fail simultaneously and thus the network gets partitioned into several disjoint network segments. Restoring intersegment connectivity is essential to avoid negative effects on the application. Employing mobile data collectors (MDCs), which by repositioning-facilitate the establishment of communication links between segments, may provide flexible solution to this problem. However the problem of finding shortest tours for MDCs is NP-Hard. In this paper we study the problem under constrained number of MDCs which makes the problem more challenging. We present a polynomial time heuristic for Interconnecting Disjoint Segments with k MDCs (IDM-kMDC). IDM-kMDC opts to minimize the tour lengths and balance the load on the k available MDCs. We model each segment by a representative. The IDM-kMDC heuristic finds k-subsets of representatives, computes an optimized tour for each subset and assigns one MDC for each tour. The performance of the algorithm is validated through simulation.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124832635","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-10DOI: 10.1109/ICC.2012.6364468
R. Rashtchi, R. Gohary, H. Yanikomeroglu
In this paper an OFDMA-based wireless ad hoc network is considered. In addition to the potential of being a source and/or a destination, each node is assumed to be capable of decoding and forwarding its received packets to other nodes in the network. The goal is to determine the optimal data routes, subchannel schedules, and power allocations that maximize a weighted sum rate of the data communicated over the network. Two instances of this problem are considered. In the first instance, each subchannel is exclusively used on one of the links, whereas in the second instance subchannels are allowed to be time shared by multiple links. The first problem gives rise to an NP-hard mixed integer optimization problem that is difficult to solve. In contrast, using a change of variables, the second problem is cast in a convex form, which is amenable to highly efficient interior point solvers. Simulation results suggest that the gain in the weighted sum rate achieved by the relaxation in the second problem over that achieved by the original mixed integer problem is negligible for small networks, and increases with the size of the network.
{"title":"Joint routing, scheduling and power allocation in OFDMA wireless ad hoc networks","authors":"R. Rashtchi, R. Gohary, H. Yanikomeroglu","doi":"10.1109/ICC.2012.6364468","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364468","url":null,"abstract":"In this paper an OFDMA-based wireless ad hoc network is considered. In addition to the potential of being a source and/or a destination, each node is assumed to be capable of decoding and forwarding its received packets to other nodes in the network. The goal is to determine the optimal data routes, subchannel schedules, and power allocations that maximize a weighted sum rate of the data communicated over the network. Two instances of this problem are considered. In the first instance, each subchannel is exclusively used on one of the links, whereas in the second instance subchannels are allowed to be time shared by multiple links. The first problem gives rise to an NP-hard mixed integer optimization problem that is difficult to solve. In contrast, using a change of variables, the second problem is cast in a convex form, which is amenable to highly efficient interior point solvers. Simulation results suggest that the gain in the weighted sum rate achieved by the relaxation in the second problem over that achieved by the original mixed integer problem is negligible for small networks, and increases with the size of the network.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125170816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-10DOI: 10.1109/ICC.2012.6364548
Boonyarith Saovapakhiran, M. Devetsikiotis, G. Michailidis, Y. Viniotis
In this paper, we conduct feasibility studies on the average delay space for Cloud computing, and we propose a heuristic method to control the vector of average delays, subject to predefined delay constraints. Our work is strongly motivated by the fact that delay control plays a critical role to improve Service Level Agreements (SLA) between users and Cloud service providers, which is necessary for empowering online business. Specifically, our main contributions are two-fold: First, the feasible regions of various routing algorithms for the system's dispatcher are investigated in depth. Second, a simple heuristic algorithm is designed, to move the average delay point along the feasible direction until achieving the delay constraints. Average delay is dependent on multiple factors such as job size, inter-arrival time, flow rate, and the dispatching rules of the system. Therefore, we vary their distribution, parameters and routing rules to examine how the feasible regions move or change. After establishing the feasible delay space, then by moving along the feasible directions, we show that a simple heuristic algorithm can achieve the delay constraints for a two queue system.
{"title":"Average delay SLAs in Cloud computing","authors":"Boonyarith Saovapakhiran, M. Devetsikiotis, G. Michailidis, Y. Viniotis","doi":"10.1109/ICC.2012.6364548","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364548","url":null,"abstract":"In this paper, we conduct feasibility studies on the average delay space for Cloud computing, and we propose a heuristic method to control the vector of average delays, subject to predefined delay constraints. Our work is strongly motivated by the fact that delay control plays a critical role to improve Service Level Agreements (SLA) between users and Cloud service providers, which is necessary for empowering online business. Specifically, our main contributions are two-fold: First, the feasible regions of various routing algorithms for the system's dispatcher are investigated in depth. Second, a simple heuristic algorithm is designed, to move the average delay point along the feasible direction until achieving the delay constraints. Average delay is dependent on multiple factors such as job size, inter-arrival time, flow rate, and the dispatching rules of the system. Therefore, we vary their distribution, parameters and routing rules to examine how the feasible regions move or change. After establishing the feasible delay space, then by moving along the feasible directions, we show that a simple heuristic algorithm can achieve the delay constraints for a two queue system.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125790476","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-10DOI: 10.1109/ICC.2012.6364106
Yonghong Zeng, Ying-Chang Liang, E. Peh
This paper considers multi-sensor multi-antenna spectrum sensing. First, it is assumed that all users are able to send their raw data to the fusion center. In this case the global optimial solution is the likelihood ratio test (LRT) using all the raw data. A simple closed-form expression for the LRT is found. Although LRT is optimal, it is hardly useful in practice due to its reliance on the knowledge of primary user's channels and noise powers of all users. Thus a method using the estimated channels and noise powers is proposed, which is called generalized LRT (GLRT). Secondly, the optimal fusion scheme (OFS) is found if each user computes its test statistic based on an eigenvalue based detection and sends the test statistic to the fusion center. Both GLRT and OFS need the SNR information of all users. To make the detections more practical, two totally blind detections, namely, approximated OFS and approximated GLRT, are proposed. Simulations are provided to support the results.
{"title":"Optimal cooperative sensing for sensors equipped with multiple antennas","authors":"Yonghong Zeng, Ying-Chang Liang, E. Peh","doi":"10.1109/ICC.2012.6364106","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364106","url":null,"abstract":"This paper considers multi-sensor multi-antenna spectrum sensing. First, it is assumed that all users are able to send their raw data to the fusion center. In this case the global optimial solution is the likelihood ratio test (LRT) using all the raw data. A simple closed-form expression for the LRT is found. Although LRT is optimal, it is hardly useful in practice due to its reliance on the knowledge of primary user's channels and noise powers of all users. Thus a method using the estimated channels and noise powers is proposed, which is called generalized LRT (GLRT). Secondly, the optimal fusion scheme (OFS) is found if each user computes its test statistic based on an eigenvalue based detection and sends the test statistic to the fusion center. Both GLRT and OFS need the SNR information of all users. To make the detections more practical, two totally blind detections, namely, approximated OFS and approximated GLRT, are proposed. Simulations are provided to support the results.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123564087","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-10DOI: 10.1109/ICC.2012.6363708
S. Fowler, R. Bhamber, A. Mellouk
The 4G standard Long Term Evolution (LTE) has been developed for high-bandwidth mobile access for today's data-heavy applications, consequently, a better experience for the end user. To extend the user equipment battery lifetime, plus further support various services and large amount of data transmissions, the 3GPP standards for LTE/LTE-Advanced has adopted discontinuous reception (DRX). However, there is a need to optimize the DRX parameters, so as to maximize power saving without incurring network re-entry and packet delays. In this paper, we provide an overview of the fixed frame DRX cycle and compare it against an adjustable DRX cycle of the LTE/LTE-Advanced power saving mechanism, by modelling the system with bursty packet data traffic using a semi-Markov process. Based on the analytical model, we will show the trade-off relationship between the power saving and wake-up delay performance.
{"title":"Analysis of adjustable and fixed DRX mechanism for power saving in LTE/LTE-Advanced","authors":"S. Fowler, R. Bhamber, A. Mellouk","doi":"10.1109/ICC.2012.6363708","DOIUrl":"https://doi.org/10.1109/ICC.2012.6363708","url":null,"abstract":"The 4G standard Long Term Evolution (LTE) has been developed for high-bandwidth mobile access for today's data-heavy applications, consequently, a better experience for the end user. To extend the user equipment battery lifetime, plus further support various services and large amount of data transmissions, the 3GPP standards for LTE/LTE-Advanced has adopted discontinuous reception (DRX). However, there is a need to optimize the DRX parameters, so as to maximize power saving without incurring network re-entry and packet delays. In this paper, we provide an overview of the fixed frame DRX cycle and compare it against an adjustable DRX cycle of the LTE/LTE-Advanced power saving mechanism, by modelling the system with bursty packet data traffic using a semi-Markov process. Based on the analytical model, we will show the trade-off relationship between the power saving and wake-up delay performance.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125403327","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-10DOI: 10.1109/ICC.2012.6364938
Jannik Dreier, P. Lafourcade, Y. Lakhnech
Privacy is one of the main issues in electronic voting. We propose a family of symbolic privacy notions that allows to assess the level of privacy ensured by a voting protocol. Our definitions are applicable to protocols featuring multiple votes per voter and special attack scenarios such as vote-copying or forced abstention. Finally we employ our definitions on several existing voting protocols to show that our model allows to compare different types of protocols based on different techniques, and is suitable for automated verification using existing tools.
{"title":"A formal taxonomy of privacy in voting protocols","authors":"Jannik Dreier, P. Lafourcade, Y. Lakhnech","doi":"10.1109/ICC.2012.6364938","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364938","url":null,"abstract":"Privacy is one of the main issues in electronic voting. We propose a family of symbolic privacy notions that allows to assess the level of privacy ensured by a voting protocol. Our definitions are applicable to protocols featuring multiple votes per voter and special attack scenarios such as vote-copying or forced abstention. Finally we employ our definitions on several existing voting protocols to show that our model allows to compare different types of protocols based on different techniques, and is suitable for automated verification using existing tools.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125464029","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-10DOI: 10.1109/ICC.2012.6364366
H. Meshgi, Dongmei Zhao
In this paper we study transmission scheduling in a bidirectional communication link, where two end nodes are communicating with each other through a relay node. Each of the two end nodes injects data into a separate buffer at the relay node, which can either forward the data from one end node to the other at a given time (referred to as one-way relay), or simultaneously forwarding the data to both the end nodes by using network coding (referred to as two-way relay). An optimization problem is formulated to find the optimum scheduling in order to maximize the total transmission throughput in both communication directions, and a heuristic scheduling scheme is proposed to opportunistically take advantages of both the channel conditions between the two end nodes and the one-way and two-way relays. Numerical results show that the proposed scheme achieves high and close-to-optimum throughput.
{"title":"Opportunistic scheduling in a bidirectional communication link with relaying","authors":"H. Meshgi, Dongmei Zhao","doi":"10.1109/ICC.2012.6364366","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364366","url":null,"abstract":"In this paper we study transmission scheduling in a bidirectional communication link, where two end nodes are communicating with each other through a relay node. Each of the two end nodes injects data into a separate buffer at the relay node, which can either forward the data from one end node to the other at a given time (referred to as one-way relay), or simultaneously forwarding the data to both the end nodes by using network coding (referred to as two-way relay). An optimization problem is formulated to find the optimum scheduling in order to maximize the total transmission throughput in both communication directions, and a heuristic scheduling scheme is proposed to opportunistically take advantages of both the channel conditions between the two end nodes and the one-way and two-way relays. Numerical results show that the proposed scheme achieves high and close-to-optimum throughput.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125518108","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-10DOI: 10.1109/ICC.2012.6364936
Abdullah Alomari, N. Aslam, Frank Comeau
In this paper we present a new data collection scheme using mobile actors in a large scale wireless sensor network (WSN). A mobile actor, or for convenience, M-actor is a mobile node that has powerful energy source, computation, and communication features. The mobile node is able to move freely through the sensor deployment, traversing through the radio transmission range of wireless sensor nodes to collect the sensed data. Once data from all sensors is collected, the M-actor returns to the base station to off-load the collected data. This paper makes two contributions. First, we present a heuristic to compute collection points, referred to as the rendezvous points (RPs). These points are computed such that full coverage is guaranteed. Second, the optimal path for the M-actor is modeled using a genetic algorithm (GA)based traveling salesman problem (TSP). The proposed scheme is evaluated through simulations. We demonstrate that the proposed scheme achieves significant improvement in reducing the tour length for the M-actor when compared with other schemes.
{"title":"Data collection using rendezvous points and mobile actor in wireless sensor networks","authors":"Abdullah Alomari, N. Aslam, Frank Comeau","doi":"10.1109/ICC.2012.6364936","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364936","url":null,"abstract":"In this paper we present a new data collection scheme using mobile actors in a large scale wireless sensor network (WSN). A mobile actor, or for convenience, M-actor is a mobile node that has powerful energy source, computation, and communication features. The mobile node is able to move freely through the sensor deployment, traversing through the radio transmission range of wireless sensor nodes to collect the sensed data. Once data from all sensors is collected, the M-actor returns to the base station to off-load the collected data. This paper makes two contributions. First, we present a heuristic to compute collection points, referred to as the rendezvous points (RPs). These points are computed such that full coverage is guaranteed. Second, the optimal path for the M-actor is modeled using a genetic algorithm (GA)based traveling salesman problem (TSP). The proposed scheme is evaluated through simulations. We demonstrate that the proposed scheme achieves significant improvement in reducing the tour length for the M-actor when compared with other schemes.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125563021","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
扫码关注我们
求助内容：
应助结果提醒方式：