Pub Date : 2012-06-11DOI: 10.1109/WCNC.2012.6214253
A. M. Barkoosaraei, H. Aghvami
Hierarchical Mobile IPv6 (HMIPv6) was proposed by Internet Engineering Task Force (IETF) to reduce signalling cost by localising the mobility signalling traffic of Mobile Nodes (MNs). However, certain MNs still generate excessive signalling overhead, due to their ping pong movement at borders of different Mobility Anchor Point (MAP) domains. In this paper, an algorithm is proposed, to effectively reduce the handover signalling overhead in the network. A cost function was developed and allocated to Access Routers (ARs) in then network, by taking into account several parameters. The proposed algorithm spreads the domain of each MAP to its adjacent MAP(s) domains by selecting boundary ARs one by one, based on their cost values, and creating overlapping regions between the domains. The performance in the new network structure created by the proposed algorithm is evaluated against a single MAP per domain HMIPv6 access network. A comparison simulation study illustrates a significant improved performance in the network is obtained, in terms of average rate of inter-area handover, whilst balance in terms of bandwidth utilisation among MAPs is maintained.
分层移动IPv6 (Hierarchical Mobile IPv6, HMIPv6)是IETF提出的一种通过对移动节点(MNs)的移动信令流量进行本地化来降低信令成本的协议。然而，由于在不同移动锚点(MAP)域边界处的乒乓运动，某些MNs仍然会产生过多的信号开销。本文提出了一种有效降低网络切换信令开销的算法。在考虑多个参数的基础上，建立了一个成本函数，并对网络中的接入路由器进行了分配。该算法根据每个MAP的代价值逐个选择边界ar，将每个MAP的域扩展到相邻的MAP(s)域中，并在域之间创建重叠区域。该算法创建的新网络结构的性能是针对单个MAP每域HMIPv6接入网进行评估的。对比仿真研究表明，在区域间切换的平均速率方面，网络性能得到了显着改善，同时在map之间的带宽利用率方面保持了平衡。
{"title":"Intelligent overlapping MAP domain forming for mobility management in HMIPv6 access networks","authors":"A. M. Barkoosaraei, H. Aghvami","doi":"10.1109/WCNC.2012.6214253","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214253","url":null,"abstract":"Hierarchical Mobile IPv6 (HMIPv6) was proposed by Internet Engineering Task Force (IETF) to reduce signalling cost by localising the mobility signalling traffic of Mobile Nodes (MNs). However, certain MNs still generate excessive signalling overhead, due to their ping pong movement at borders of different Mobility Anchor Point (MAP) domains. In this paper, an algorithm is proposed, to effectively reduce the handover signalling overhead in the network. A cost function was developed and allocated to Access Routers (ARs) in then network, by taking into account several parameters. The proposed algorithm spreads the domain of each MAP to its adjacent MAP(s) domains by selecting boundary ARs one by one, based on their cost values, and creating overlapping regions between the domains. The performance in the new network structure created by the proposed algorithm is evaluated against a single MAP per domain HMIPv6 access network. A comparison simulation study illustrates a significant improved performance in the network is obtained, in terms of average rate of inter-area handover, whilst balance in terms of bandwidth utilisation among MAPs is maintained.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123796705","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-04-01DOI: 10.1109/WCNC.2012.6214227
An-Ni Shen, Song Guo, Deze Zeng, M. Guizani
Many services and applications in vehicular ad-hoc networks (VANETs) require preserving and secure data communications. To improve driving safety and comfort, the traffic-related status information will be broadcasted regularly and shared among drivers. Without the security and privacy guarantee, attackers could track their interested vehicles by collecting and analyzing their traffic messages. Hence, anonymous message authentication is an essential requirement of VANETs. On the other hand, when a vehicle is involved in a dispute event of warning message, the certificate authority should be able to recover the real identity of this vehicle. To deal with this issue, we propose a new privacy-preserving authentication protocol with authority traceability using elliptic curve based chameleon hashing. Compared with existing schemes, our approach possesses the following features: (1) mutual and anonymous authentication, (2) unlinkability, (3) authority tracking capability and (4) high efficiency. We also demonstrate the merits of our proposed scheme through extensive security analysis and performance evaluation.
{"title":"A lightweight privacy-preserving protocol using chameleon hashing for secure vehicular communications","authors":"An-Ni Shen, Song Guo, Deze Zeng, M. Guizani","doi":"10.1109/WCNC.2012.6214227","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214227","url":null,"abstract":"Many services and applications in vehicular ad-hoc networks (VANETs) require preserving and secure data communications. To improve driving safety and comfort, the traffic-related status information will be broadcasted regularly and shared among drivers. Without the security and privacy guarantee, attackers could track their interested vehicles by collecting and analyzing their traffic messages. Hence, anonymous message authentication is an essential requirement of VANETs. On the other hand, when a vehicle is involved in a dispute event of warning message, the certificate authority should be able to recover the real identity of this vehicle. To deal with this issue, we propose a new privacy-preserving authentication protocol with authority traceability using elliptic curve based chameleon hashing. Compared with existing schemes, our approach possesses the following features: (1) mutual and anonymous authentication, (2) unlinkability, (3) authority tracking capability and (4) high efficiency. We also demonstrate the merits of our proposed scheme through extensive security analysis and performance evaluation.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"53 54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115416490","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-04-01DOI: 10.1109/WCNC.2012.6214031
M. Bansal, A. Trivedi
Wireless mesh networks (WMNs) are emerging as a cost effective solution for last-mile broadband access. Multiple antennas or multiple input multiple output (MIMO)-based systems have the potential for improving the capacity of these networks manifolds. However, unique physical layer characteristics associated with MIMO-based systems require joint design among physical layer and upper layers. In this paper, we investigate the problem of jointly optimizing routing and stream control scheduling in a MIMO-based WMN, where multiple antennas are exploited to increase the capacity via spatial reuse (SR) and/or spatial multiplexing (SM). A column generation (CG) method is used to efficiently solved the problem. For the difficult pricing problem that arises in the CG procedure, we propose a computationally efficient heuristic algorithm. A combination of dual decomposition and gradient-based methods are used to decouple the network layer and link layer operations. Simulation results are presented to evaluate the performance of the proposed scheme.
{"title":"An efficient CG-based approach for joint routing and scheduling in MIMO-based WMNs","authors":"M. Bansal, A. Trivedi","doi":"10.1109/WCNC.2012.6214031","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214031","url":null,"abstract":"Wireless mesh networks (WMNs) are emerging as a cost effective solution for last-mile broadband access. Multiple antennas or multiple input multiple output (MIMO)-based systems have the potential for improving the capacity of these networks manifolds. However, unique physical layer characteristics associated with MIMO-based systems require joint design among physical layer and upper layers. In this paper, we investigate the problem of jointly optimizing routing and stream control scheduling in a MIMO-based WMN, where multiple antennas are exploited to increase the capacity via spatial reuse (SR) and/or spatial multiplexing (SM). A column generation (CG) method is used to efficiently solved the problem. For the difficult pricing problem that arises in the CG procedure, we propose a computationally efficient heuristic algorithm. A combination of dual decomposition and gradient-based methods are used to decouple the network layer and link layer operations. Simulation results are presented to evaluate the performance of the proposed scheme.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116879548","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-04-01DOI: 10.1109/WCNC.2012.6214208
Xinli Zhou, A-Long Jin, Q. Meng
Geolocation and tracking of mobile objects is an important issue in wireless communication networks. Various methods have been devised and implemented to deal with such problems whose performance is particularly limited in non-line-of-sight propagation conditions. In this paper, we take advantage of the extended Kalman filter with some extensions, modifications and improvement of previous work to reduce the NLOS error in the location measurement. One of the key contributions of this paper is to present the methods that discriminate the NLOS measurements from the LOS measurements based on the standard deviation and K-means clustering and reconstruct the LOS measurements out of the NLOS measurements by polynomial fit in order to mitigate the NLOS error. Simulation results confirm the effectiveness and accuracy of our approach in comparison with the conventional EKF algorithm. Moreover, we do not model the distribution of the NLOS error due to its intractability.
{"title":"NLOS error mitigation in mobile location based on modified extended Kalman filter","authors":"Xinli Zhou, A-Long Jin, Q. Meng","doi":"10.1109/WCNC.2012.6214208","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214208","url":null,"abstract":"Geolocation and tracking of mobile objects is an important issue in wireless communication networks. Various methods have been devised and implemented to deal with such problems whose performance is particularly limited in non-line-of-sight propagation conditions. In this paper, we take advantage of the extended Kalman filter with some extensions, modifications and improvement of previous work to reduce the NLOS error in the location measurement. One of the key contributions of this paper is to present the methods that discriminate the NLOS measurements from the LOS measurements based on the standard deviation and K-means clustering and reconstruct the LOS measurements out of the NLOS measurements by polynomial fit in order to mitigate the NLOS error. Simulation results confirm the effectiveness and accuracy of our approach in comparison with the conventional EKF algorithm. Moreover, we do not model the distribution of the NLOS error due to its intractability.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121085951","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-04-01DOI: 10.1109/WCNC.2012.6213995
Woongsup Lee, D. Cho
In this paper, we compare the performance of two major spectrum information acquisition schemes in cognitive radio system, which are geo-location database based scheme and spectrum sensing based scheme. Although these two schemes are the major spectrum information acquisition schemes which are mainly considered in current researches on cognitive radio system, the comparison of two schemes has not been considered in previous works. In the comparison, we propose a new channel model for the cognitive environment which has three states, because recent measurements show that two-state Markov Chain model which has been widely used is not appropriate to model the cognitive environment. And based on the new channel model, we propose a new spectrum sensing scheme to reduce sensing overhead. Through performance analysis and numerical results, we show that our analysis is accurate and that the number of spectrum sensing can be reduced by using our proposed scheme so that the throughput of a cognitive radio system can be improved. We also find that the throughput of a spectrum sensing based scheme is better than that of a geo-location database based scheme in general cognitive environment.
{"title":"Comparison of channel information acquisition schemes in cognitive radio system","authors":"Woongsup Lee, D. Cho","doi":"10.1109/WCNC.2012.6213995","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6213995","url":null,"abstract":"In this paper, we compare the performance of two major spectrum information acquisition schemes in cognitive radio system, which are geo-location database based scheme and spectrum sensing based scheme. Although these two schemes are the major spectrum information acquisition schemes which are mainly considered in current researches on cognitive radio system, the comparison of two schemes has not been considered in previous works. In the comparison, we propose a new channel model for the cognitive environment which has three states, because recent measurements show that two-state Markov Chain model which has been widely used is not appropriate to model the cognitive environment. And based on the new channel model, we propose a new spectrum sensing scheme to reduce sensing overhead. Through performance analysis and numerical results, we show that our analysis is accurate and that the number of spectrum sensing can be reduced by using our proposed scheme so that the throughput of a cognitive radio system can be improved. We also find that the throughput of a spectrum sensing based scheme is better than that of a geo-location database based scheme in general cognitive environment.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121231612","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-04-01DOI: 10.1109/WCNC.2012.6214080
Qiumin Dong, D. Niyato, Ping Wang
The smart grid uses data communications techniques to gather and transfer information for scheduling and decision making so that the electric power can be used more efficiently and economically. To reduce the cost of data communications in smart grid, in this paper, we assume that cognitive radio technique is used to transmit the meter data from smart meters to the data aggregator unit (DAU). Smart meters are deployed in the houses representing consumption nodes to measure and report power demand. Also, smart meters are used by generators of the community renewable power generation facility (CRPGF) which is one of the distributed energy resources (DERs), to collect and estimate renewable power production capacity. However, the transmission of meter data must be performed within a limited period of time (i.e., deadline). By using absorbing Markov chain, we analyze the average packet loss probability of meter data, and study the impact of packet loss on the power supply cost optimization made by the meter data management system (MDMS).
{"title":"Dynamic spectrum access for meter data transmission in smart grid: Analysis of packet loss","authors":"Qiumin Dong, D. Niyato, Ping Wang","doi":"10.1109/WCNC.2012.6214080","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214080","url":null,"abstract":"The smart grid uses data communications techniques to gather and transfer information for scheduling and decision making so that the electric power can be used more efficiently and economically. To reduce the cost of data communications in smart grid, in this paper, we assume that cognitive radio technique is used to transmit the meter data from smart meters to the data aggregator unit (DAU). Smart meters are deployed in the houses representing consumption nodes to measure and report power demand. Also, smart meters are used by generators of the community renewable power generation facility (CRPGF) which is one of the distributed energy resources (DERs), to collect and estimate renewable power production capacity. However, the transmission of meter data must be performed within a limited period of time (i.e., deadline). By using absorbing Markov chain, we analyze the average packet loss probability of meter data, and study the impact of packet loss on the power supply cost optimization made by the meter data management system (MDMS).","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127180058","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-04-01DOI: 10.1109/WCNC.2012.6214079
Farhan H. Mirani, N. Boukhatem
With widespread deployment of often overlapping mobile and wireless coverage today, modern-day smartphones may have the capability to transmit data using multiple parallel paths to improve overall communication throughput. However, multipath data transfers have serious compatibility issues with reliable transport layer protocols which dictate the data to be received at the receiver in strict sequenced order. Failing which, multipath transfers cause out-of-order data reception leading to higher data buffering and reordering costs as well as packet retransmissions. Forward Prediction Scheduling (FPS) is a data scheduling mechanism that deals with multipath data transfers by predicting which data to transmit on each available path so that the problems associated with the out-of-order data reception are avoided. This paper presents performance evaluation of FPS scheduling mechanism on a Linux-based mobile terminal called Neo FreeRunner using a variety of multiple interfaces, in particular 3G, WiFi and Ethernet. The FPS mechanism is implemented in a Linux-kernel based version of Stream Control Transmission Protocol (SCTP).
{"title":"Evaluation of forward prediction scheduling in heterogeneous access networks","authors":"Farhan H. Mirani, N. Boukhatem","doi":"10.1109/WCNC.2012.6214079","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214079","url":null,"abstract":"With widespread deployment of often overlapping mobile and wireless coverage today, modern-day smartphones may have the capability to transmit data using multiple parallel paths to improve overall communication throughput. However, multipath data transfers have serious compatibility issues with reliable transport layer protocols which dictate the data to be received at the receiver in strict sequenced order. Failing which, multipath transfers cause out-of-order data reception leading to higher data buffering and reordering costs as well as packet retransmissions. Forward Prediction Scheduling (FPS) is a data scheduling mechanism that deals with multipath data transfers by predicting which data to transmit on each available path so that the problems associated with the out-of-order data reception are avoided. This paper presents performance evaluation of FPS scheduling mechanism on a Linux-based mobile terminal called Neo FreeRunner using a variety of multiple interfaces, in particular 3G, WiFi and Ethernet. The FPS mechanism is implemented in a Linux-kernel based version of Stream Control Transmission Protocol (SCTP).","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127231950","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-04-01DOI: 10.1109/WCNC.2012.6214142
P. Swar, Y. Ye, K. Ghaboosi, K. Pahlavan
This paper presents an analysis on localization accuracy of a capsule used for wireless endoscopy application when there are random variations in transmit power of sensor nodes. We use a three-dimensional human body model and the log normal model for Received Signal Strength (RSS) radio propagation from the implant to the sensor nodes on the body surface to find accuracy bounds in three digestive organs, namely stomach, small intestine, and large intestine, which form the human Gastro-Intestinal (GI) track. The analysis is done using Bayesian Crameŕ-Rao bound assuming that the transmit power is random process with known prior distribution. We provide analysis of the factors affecting localization accuracy including various organ environment, external sensor array topology. The simulation results show that the capsule localization inside large intestine is affected the most with the transmit power randomness, while wireless capsule can be localized with best accuracy inside the small intestine. Finally, we propose an approach to improve the attainable accuracy bounds.
{"title":"On effect of transmit power variance on localization accuracy in wireless capsule endoscopy","authors":"P. Swar, Y. Ye, K. Ghaboosi, K. Pahlavan","doi":"10.1109/WCNC.2012.6214142","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214142","url":null,"abstract":"This paper presents an analysis on localization accuracy of a capsule used for wireless endoscopy application when there are random variations in transmit power of sensor nodes. We use a three-dimensional human body model and the log normal model for Received Signal Strength (RSS) radio propagation from the implant to the sensor nodes on the body surface to find accuracy bounds in three digestive organs, namely stomach, small intestine, and large intestine, which form the human Gastro-Intestinal (GI) track. The analysis is done using Bayesian Crameŕ-Rao bound assuming that the transmit power is random process with known prior distribution. We provide analysis of the factors affecting localization accuracy including various organ environment, external sensor array topology. The simulation results show that the capsule localization inside large intestine is affected the most with the transmit power randomness, while wireless capsule can be localized with best accuracy inside the small intestine. Finally, we propose an approach to improve the attainable accuracy bounds.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124953565","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-04-01DOI: 10.1109/WCNC.2012.6214396
Hoc Phan, T. Duong, H. Zepernick
In this paper, the performance of a dual-hop multiple-input multiple-output (MIMO) cooperative multiple-relay network using orthogonal space-time block coding (OS-TBC) transmission is examined. The fading environment is modeled as independent, not identical distributed (i.n.i.d.) Nakagami-m fading. Also, we consider the case that each terminal in the network has multiple-antennas, the relays operate in channel state information (CSI)-assisted amplify-and-forward (AF) relaying mode, and the direct transmission from the source to the destination is applicable. In particular, we derive a closed-form expression for the moment generating function (MGF) of the instantaneous signal-to-noise ratio (SNR). Utilizing this derivation, we can analyze the SER performance of the considered system for M-ary phase shift-keying (M-PSK) and M-ary quadrature amplitude modulation (M-QAM) scheme. Also, the outage performance of the considered relay networks is evaluated. We further investigate the cooperative diversity behavior by deriving asymptotic approximations for the outage probability and the SER. Finally, numerical results are provided showing very close agreement between the analytical results and the Monte-Carlo simulations.
{"title":"MIMO cooperative multiple-relay networks with OSTBCs over Nakagami-m fading","authors":"Hoc Phan, T. Duong, H. Zepernick","doi":"10.1109/WCNC.2012.6214396","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214396","url":null,"abstract":"In this paper, the performance of a dual-hop multiple-input multiple-output (MIMO) cooperative multiple-relay network using orthogonal space-time block coding (OS-TBC) transmission is examined. The fading environment is modeled as independent, not identical distributed (i.n.i.d.) Nakagami-m fading. Also, we consider the case that each terminal in the network has multiple-antennas, the relays operate in channel state information (CSI)-assisted amplify-and-forward (AF) relaying mode, and the direct transmission from the source to the destination is applicable. In particular, we derive a closed-form expression for the moment generating function (MGF) of the instantaneous signal-to-noise ratio (SNR). Utilizing this derivation, we can analyze the SER performance of the considered system for M-ary phase shift-keying (M-PSK) and M-ary quadrature amplitude modulation (M-QAM) scheme. Also, the outage performance of the considered relay networks is evaluated. We further investigate the cooperative diversity behavior by deriving asymptotic approximations for the outage probability and the SER. Finally, numerical results are provided showing very close agreement between the analytical results and the Monte-Carlo simulations.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125119814","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-04-01DOI: 10.1109/WCNC.2012.6214100
Mohamed-Haykel Zayani, D. Zeghlache
Ad-hoc networks are independent of any infrastructure. The nodes are autonomous and make their own decisions. They also have limited energy resources. Thus, a node tends to behave selfishly when it is asked to forward the packets of other nodes. Indeed, it would rather choose to reject a forwarding request in order to save its energy. To overcome this problem, the nodes need to be motivated to cooperate. To this end, we propose a self-learning repeated game framework to enforce cooperation between the nodes of a network. This framework is inspired by the concept of “The Weakest Link” TV game. Each node has a utility function whose value depends on its cooperation in forwarding packets on a route as well as the cooperation of all the nodes that form this same route. The more these nodes cooperate the higher is their utility value. This would establish a cooperative spirit within the nodes of the networks. All the nodes will then more or less equally participate to the forwarding tasks which would then eventually guarantee a more efficient packets forwarding from sources to respective destinations. Simulations are run and the results show that the proposed framework efficiently enforces nodes to cooperate and outperforms two other self-learning repeated game frameworks which we are interested in.
{"title":"Cooperation enforcement for packet forwarding optimization in multi-hop ad-hoc networks","authors":"Mohamed-Haykel Zayani, D. Zeghlache","doi":"10.1109/WCNC.2012.6214100","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214100","url":null,"abstract":"Ad-hoc networks are independent of any infrastructure. The nodes are autonomous and make their own decisions. They also have limited energy resources. Thus, a node tends to behave selfishly when it is asked to forward the packets of other nodes. Indeed, it would rather choose to reject a forwarding request in order to save its energy. To overcome this problem, the nodes need to be motivated to cooperate. To this end, we propose a self-learning repeated game framework to enforce cooperation between the nodes of a network. This framework is inspired by the concept of “The Weakest Link” TV game. Each node has a utility function whose value depends on its cooperation in forwarding packets on a route as well as the cooperation of all the nodes that form this same route. The more these nodes cooperate the higher is their utility value. This would establish a cooperative spirit within the nodes of the networks. All the nodes will then more or less equally participate to the forwarding tasks which would then eventually guarantee a more efficient packets forwarding from sources to respective destinations. Simulations are run and the results show that the proposed framework efficiently enforces nodes to cooperate and outperforms two other self-learning repeated game frameworks which we are interested in.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125419738","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
扫码关注我们
求助内容：
应助结果提醒方式：