The construction of space-time codes for wireless cooperative communications is investigated by considering a pragmatic approach based on the concatenation of convolutional codes and BPSK/QPSK modulation to obtain cooperative codes for relay networks. We also derive the pairwise error probability, an asymptotic bound for frame error probability and a design criterion to optimize both diversity and coding gain. This framework is useful to characterize the behavior of cooperative pragmatic space-time codes (CP-STC) and to set up a code search procedure to obtain good pragmatic space-time codes (P-STC) with overlay construction (COP-STC) which are suitable for cooperative communication with a variable number of relays in quasi static channel. We find that P-STCs perform quite well in block fading channels, including quasi-static channel, even with a low number of states and relays, despite the fact that the implementation of P-STC requires common convolutional encoders and Viterbi decoders with suitable generators and rates, thus having low complexity.
{"title":"Cooperative Relaying with Pragmatic Space-Time Codes","authors":"A. Conti, V. Tralli, M. Chiani","doi":"10.1109/ICCW.2008.73","DOIUrl":"https://doi.org/10.1109/ICCW.2008.73","url":null,"abstract":"The construction of space-time codes for wireless cooperative communications is investigated by considering a pragmatic approach based on the concatenation of convolutional codes and BPSK/QPSK modulation to obtain cooperative codes for relay networks. We also derive the pairwise error probability, an asymptotic bound for frame error probability and a design criterion to optimize both diversity and coding gain. This framework is useful to characterize the behavior of cooperative pragmatic space-time codes (CP-STC) and to set up a code search procedure to obtain good pragmatic space-time codes (P-STC) with overlay construction (COP-STC) which are suitable for cooperative communication with a variable number of relays in quasi static channel. We find that P-STCs perform quite well in block fading channels, including quasi-static channel, even with a low number of states and relays, despite the fact that the implementation of P-STC requires common convolutional encoders and Viterbi decoders with suitable generators and rates, thus having low complexity.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129917911","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 order to fulfill the interworking functionalities between the heterogeneous wireless access networks, a heterogeneous cooperative relay node based convergence structure for the interworking is presented. A utility-based performance optimization model for the cooperative heterogeneous wireless communication systems is proposed to analyze the cooperative diversity gain, in which the optimal theoretical performance model for the cooperative relay node selection strategy is deduced. Based on the proposed theoretical models and considering the computation complexity, the sub-optimal cooperative relay node selection algorithm is determined to pursue the maximum spectrum efficiency from the global viewpoint of heterogeneous wireless communication systems under the conditions of guaranteeing the equivalent transmission rates between the first and second hops. The simulation results demonstrate that the proposed cooperative relay node selection algorithm can improve performances by achieving the cooperative gain.
{"title":"Investigation of Cooperative Relay Node Selection in Heterogeneous Wireless Communication Systems","authors":"M. Peng, Wenbo Wang","doi":"10.1109/ICCW.2008.38","DOIUrl":"https://doi.org/10.1109/ICCW.2008.38","url":null,"abstract":"In order to fulfill the interworking functionalities between the heterogeneous wireless access networks, a heterogeneous cooperative relay node based convergence structure for the interworking is presented. A utility-based performance optimization model for the cooperative heterogeneous wireless communication systems is proposed to analyze the cooperative diversity gain, in which the optimal theoretical performance model for the cooperative relay node selection strategy is deduced. Based on the proposed theoretical models and considering the computation complexity, the sub-optimal cooperative relay node selection algorithm is determined to pursue the maximum spectrum efficiency from the global viewpoint of heterogeneous wireless communication systems under the conditions of guaranteeing the equivalent transmission rates between the first and second hops. The simulation results demonstrate that the proposed cooperative relay node selection algorithm can improve performances by achieving the cooperative gain.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133142298","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 investigates using minimum-mean- square-error frequency-domain equalization (MMSE-FDE) based on a simple signal-to-noise ratio (SNR) estimation method for single-carrier block transmission (SCBT) over multi-path fading channels. The SNR was estimated by using channel frequency response (CFR) estimates obtained in the frequency domain. The performance was evaluated in the environments of IEEE 802.15.3c which is an emerging 60-GHz standard supporting data rates of multi-giga bits per second (multi-Gbps). We also introduced the radio frequency (RF) impairments into the simulations. The Reed-Solomon (RS) codes were used to correct errors. The simulation results show that by using reasonable number of channel estimation sequences (CES), the MMSE-FDE based on estimated SNR has only 0.8dB performance degradation in comparison with the one with perfect channel information. Thus, SCBT with MMSE-FDE (aided by SNR estimation) is very promising for realizing data rates of multi-Gbps in wireless personal area network (WPAN).
{"title":"MMSE-FDE Based on Estimated SNR for Single-Carrier Block Transmission (SCBT) in Multi-Gbps WPAN (IEEE 802.15.3c)","authors":"M. Lei, I. Lakkis, H. Harada, S. Kato","doi":"10.1109/ICCW.2008.15","DOIUrl":"https://doi.org/10.1109/ICCW.2008.15","url":null,"abstract":"This paper investigates using minimum-mean- square-error frequency-domain equalization (MMSE-FDE) based on a simple signal-to-noise ratio (SNR) estimation method for single-carrier block transmission (SCBT) over multi-path fading channels. The SNR was estimated by using channel frequency response (CFR) estimates obtained in the frequency domain. The performance was evaluated in the environments of IEEE 802.15.3c which is an emerging 60-GHz standard supporting data rates of multi-giga bits per second (multi-Gbps). We also introduced the radio frequency (RF) impairments into the simulations. The Reed-Solomon (RS) codes were used to correct errors. The simulation results show that by using reasonable number of channel estimation sequences (CES), the MMSE-FDE based on estimated SNR has only 0.8dB performance degradation in comparison with the one with perfect channel information. Thus, SCBT with MMSE-FDE (aided by SNR estimation) is very promising for realizing data rates of multi-Gbps in wireless personal area network (WPAN).","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"130 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130179535","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 a spectrum efficient uplink communication method for cooperative wireless networks is presented. In cellular controlled peer to peer (CCP2P) cooperative wireless networks the mobile device is logically connected over cellular links with the base station and simultaneously over short-range links with neighboring mobile devices to form cooperative clusters. So far the physical communication over cellular links and over short-range links are separated in time or in frequency. Beyond this state of the art, we exploit a method, referred to as asymmetrical modulation, where a mobile device is generating signals that are conveyed towards the base station and the neighboring devices in the same frequency and even at the same time. The signal is composed in such a way that it has different meanings for the neighboring devices than the base station. While the base station is getting the coarse information, the neighboring devices are getting the fine grained information reading between the lines. Our analytical analysis and simulation results show that asymmetrical modulation can improve the spectrum efficiency and reduce the data queuing delay with neither degrading the symbol error rate performance nor increasing the average energy per bit.
{"title":"Asymmetrical Modulation for Uplink Communication in Cooperative Networks","authors":"Qi Zhang, F. Fitzek, V. Iversen","doi":"10.1109/ICCW.2008.21","DOIUrl":"https://doi.org/10.1109/ICCW.2008.21","url":null,"abstract":"In this paper a spectrum efficient uplink communication method for cooperative wireless networks is presented. In cellular controlled peer to peer (CCP2P) cooperative wireless networks the mobile device is logically connected over cellular links with the base station and simultaneously over short-range links with neighboring mobile devices to form cooperative clusters. So far the physical communication over cellular links and over short-range links are separated in time or in frequency. Beyond this state of the art, we exploit a method, referred to as asymmetrical modulation, where a mobile device is generating signals that are conveyed towards the base station and the neighboring devices in the same frequency and even at the same time. The signal is composed in such a way that it has different meanings for the neighboring devices than the base station. While the base station is getting the coarse information, the neighboring devices are getting the fine grained information reading between the lines. Our analytical analysis and simulation results show that asymmetrical modulation can improve the spectrum efficiency and reduce the data queuing delay with neither degrading the symbol error rate performance nor increasing the average energy per bit.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115131024","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}
J. Yackoski, Lu Zhang, Bo Gui, Chien-Chung Shen, L. Cimini
Information theoretic studies have shown the significant performance improvements of cooperative communications. However, these studies ignore both the overheads incurred in real implementations of the cooperative techniques at the physical layer and their interactions with higher layer protocols in a networking context. In this paper, we study the performance of realistic networking scenarios facilitated by cooperation by taking overheads incurred at the physical, MAC, and network layers into account. In particular, (1) we modify the physical layer model of the QualNet network simulator to incorporate decentralized distributed space-time block coding into all SINR calculations and to combine signals transmitted concurrently from multiple relays, (2) we implement a path-centric MAC protocol to both reserve a multihop path between source and destination nodes and coordination relay nodes, and (3) we modify the DSR protocol to support path reservation at the network layer. Preliminary simulation results demonstrate that significant performance improvement can be achieved by employing cooperation. We also demonstrate the overheads which challenge their effectiveness in real networks.
{"title":"Realistic Evaluation of Cooperative Relaying Networks Using Decentralized Distributed Space-Time Block Coding","authors":"J. Yackoski, Lu Zhang, Bo Gui, Chien-Chung Shen, L. Cimini","doi":"10.1109/ICCW.2008.71","DOIUrl":"https://doi.org/10.1109/ICCW.2008.71","url":null,"abstract":"Information theoretic studies have shown the significant performance improvements of cooperative communications. However, these studies ignore both the overheads incurred in real implementations of the cooperative techniques at the physical layer and their interactions with higher layer protocols in a networking context. In this paper, we study the performance of realistic networking scenarios facilitated by cooperation by taking overheads incurred at the physical, MAC, and network layers into account. In particular, (1) we modify the physical layer model of the QualNet network simulator to incorporate decentralized distributed space-time block coding into all SINR calculations and to combine signals transmitted concurrently from multiple relays, (2) we implement a path-centric MAC protocol to both reserve a multihop path between source and destination nodes and coordination relay nodes, and (3) we modify the DSR protocol to support path reservation at the network layer. Preliminary simulation results demonstrate that significant performance improvement can be achieved by employing cooperation. We also demonstrate the overheads which challenge their effectiveness in real networks.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134109631","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}
We consider a hierarchical spectrum sharing scheme wherein a secondary wireless system is allowed to share spectrum while maintaining priority for the primary system. Under this setting, we consider the problem of allocating transmit powers for the primary and secondary transmissions so as to maximize the sum rate of the two systems, while maintaining a minimum rate for the primary system. We determine the optimum power allocation for two cases corresponding to power values being (i) continuous real in a given range, and (ii) from a discrete set. We show that the optimal power allocation for both cases can be found to be one among a small set of points, and can be determined by an O(1) algorithm.
{"title":"Optimum Power Allocation in a Hierarchical Spectrum Sharing Scheme","authors":"Z. Beyaztas, A. Pandharipande, D. Gesbert","doi":"10.1109/ICCW.2008.23","DOIUrl":"https://doi.org/10.1109/ICCW.2008.23","url":null,"abstract":"We consider a hierarchical spectrum sharing scheme wherein a secondary wireless system is allowed to share spectrum while maintaining priority for the primary system. Under this setting, we consider the problem of allocating transmit powers for the primary and secondary transmissions so as to maximize the sum rate of the two systems, while maintaining a minimum rate for the primary system. We determine the optimum power allocation for two cases corresponding to power values being (i) continuous real in a given range, and (ii) from a discrete set. We show that the optimal power allocation for both cases can be found to be one among a small set of points, and can be determined by an O(1) algorithm.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130015167","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. Sokolowski, M. Petrova, A. de Baynast, P. Mahonen
The next generation of wireless communication devices should support advanced features such as high spectral efficiency, broad bandwidth, diverse quality of service (QoS) requirements, and adaptivity. The cognitive radio (CR) is a new paradigm which has a high potential to become a basis for the future wireless systems. This paper is a first step towards the implementation of such a system. Our CR testbed is based on a GNU Radio platform which enables flexibility and reconfigurability of transmission parameters. As machine learning component, we invoke genetic algorithm (GA) to optimize the transmission parameters such as transmission power, modulation order and frequency channel based on the current spectrum conditions. Unlike other CR implementations, our approach requires very limited feedback information at the transmitter (ap 8 bits/packet duration). No transmission model nor additional network state information (NSI)is needed at the transmitter side. Experimentations show that our CR is capable to find free channels within 4-5 iterations even in a highly occupied spectrum scenario. It also offers the optimal trade-off between throughput, reliability, and power consumption depending on the user's QoS requirements.
{"title":"Cognitive Radio Testbed: Exploiting Limited Feedback in Tomorrow's Wireless Communication Networks","authors":"C. Sokolowski, M. Petrova, A. de Baynast, P. Mahonen","doi":"10.1109/ICCW.2008.99","DOIUrl":"https://doi.org/10.1109/ICCW.2008.99","url":null,"abstract":"The next generation of wireless communication devices should support advanced features such as high spectral efficiency, broad bandwidth, diverse quality of service (QoS) requirements, and adaptivity. The cognitive radio (CR) is a new paradigm which has a high potential to become a basis for the future wireless systems. This paper is a first step towards the implementation of such a system. Our CR testbed is based on a GNU Radio platform which enables flexibility and reconfigurability of transmission parameters. As machine learning component, we invoke genetic algorithm (GA) to optimize the transmission parameters such as transmission power, modulation order and frequency channel based on the current spectrum conditions. Unlike other CR implementations, our approach requires very limited feedback information at the transmitter (ap 8 bits/packet duration). No transmission model nor additional network state information (NSI)is needed at the transmitter side. Experimentations show that our CR is capable to find free channels within 4-5 iterations even in a highly occupied spectrum scenario. It also offers the optimal trade-off between throughput, reliability, and power consumption depending on the user's QoS requirements.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129448125","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}
Ad hoc network (MANET) is a collection of mobile nodes that can communicate with each other without using any fixed infrastructure. To support multimedia applications MANETs require an efficient routing protocol and quality of service (QoS) mechanism. Node-Disjoint Multipath Routing Protocol (NDMR) is a practical protocol in MANETs: it reduces routing overhead dramatically and achieves multiple node-disjoint routing paths. QoS support in MANETs is an important issue as best-effort routing is not efficient for supporting multimedia applications. This paper presents a novel adaptation of NDMR: QoS enabled NDMR, which provides QoS support for MANETS. This paper also introduces the limitation of NDMR and shows the performance comparisons.
自组织网络(MANET)是一组移动节点的集合，这些节点可以在不使用任何固定基础设施的情况下相互通信。为了支持多媒体应用，manet需要一个有效的路由协议和服务质量(QoS)机制。NDMR (Node-Disjoint multi - path Routing Protocol)是一种实用的多节点路由协议，它能显著降低路由开销，实现多节点不相交的路由路径。由于“尽力而为”路由在支持多媒体应用时效率不高，因此对manet中的QoS支持是一个重要问题。本文提出了一种新的NDMR改编:QoS - enabled NDMR，它为MANETS提供QoS支持。本文还介绍了NDMR的局限性，并进行了性能比较。
{"title":"A Novel QoS in Node-Disjoint Routing for Ad Hoc Networks","authors":"Luo-kun Liu, L. Cuthbert","doi":"10.1109/ICCW.2008.43","DOIUrl":"https://doi.org/10.1109/ICCW.2008.43","url":null,"abstract":"Ad hoc network (MANET) is a collection of mobile nodes that can communicate with each other without using any fixed infrastructure. To support multimedia applications MANETs require an efficient routing protocol and quality of service (QoS) mechanism. Node-Disjoint Multipath Routing Protocol (NDMR) is a practical protocol in MANETs: it reduces routing overhead dramatically and achieves multiple node-disjoint routing paths. QoS support in MANETs is an important issue as best-effort routing is not efficient for supporting multimedia applications. This paper presents a novel adaptation of NDMR: QoS enabled NDMR, which provides QoS support for MANETS. This paper also introduces the limitation of NDMR and shows the performance comparisons.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"204 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122449945","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}
Zhigang Wen, T. Luo, Weidong Xiang, S. Majhi, Yun-hong Ma
In this paper, an autoregressive channel prediction model is presented for cognitive radio(CR) systems to estimate spectrum holes. This model adopts a second-order autoregressive process and a Kalman filter. A Bayes risk criterion for spectrum hole detection is presented by considering interference temperature and channel idle probability. Theoretical analysis and simulations show that CR systems based on this scheme can greatly reduce the number of collisions between licensed users and rental users.
{"title":"Autoregressive Spectrum Hole Prediction Model for Cognitive Radio Systems","authors":"Zhigang Wen, T. Luo, Weidong Xiang, S. Majhi, Yun-hong Ma","doi":"10.1109/ICCW.2008.34","DOIUrl":"https://doi.org/10.1109/ICCW.2008.34","url":null,"abstract":"In this paper, an autoregressive channel prediction model is presented for cognitive radio(CR) systems to estimate spectrum holes. This model adopts a second-order autoregressive process and a Kalman filter. A Bayes risk criterion for spectrum hole detection is presented by considering interference temperature and channel idle probability. Theoretical analysis and simulations show that CR systems based on this scheme can greatly reduce the number of collisions between licensed users and rental users.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123468343","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}
Traditional simulators cannot meet the requirement of modeling large scale networks due to their deficiency in scalability. In this paper, we present a new simulator, namely EasiSim, for sensor networks on a large scale. EasiSim is featured by a structure-based modeling method and a hierarchical organization of the relevant functional components, including nodes, topology and scenario. The nodes are organized into a three-dimensional sorted list (3D list), which enables the node to process all the concurrent events in one batch, and therefore the running time may be reduced by an order of magnitude. Integrated with the other two upper layer components, which are topology and scenario, the proposed node organization method based on the 3D list makes the simulator not only scalable but also extensible. Moreover, we propose a visualization scheme based on a client/server model which separates the graphical user interface (GUI) from the simulation engine, and therefore the scalability of the simulator will not be decreased. The performance of EasiSim is evaluated through extensive simulations and compared with ns-2 in terms of real running time and memory usage. The results show that EasiSim takes less time and less memory than ns-2 to complete simulations with the same number of nodes during a same configured simulation time.
{"title":"EasiSim: A Scalable Simulation Platform for Wireless Sensor Networks","authors":"H. Chen, Li Cui, He Zhu, Changcheng Huang","doi":"10.1109/ICCW.2008.40","DOIUrl":"https://doi.org/10.1109/ICCW.2008.40","url":null,"abstract":"Traditional simulators cannot meet the requirement of modeling large scale networks due to their deficiency in scalability. In this paper, we present a new simulator, namely EasiSim, for sensor networks on a large scale. EasiSim is featured by a structure-based modeling method and a hierarchical organization of the relevant functional components, including nodes, topology and scenario. The nodes are organized into a three-dimensional sorted list (3D list), which enables the node to process all the concurrent events in one batch, and therefore the running time may be reduced by an order of magnitude. Integrated with the other two upper layer components, which are topology and scenario, the proposed node organization method based on the 3D list makes the simulator not only scalable but also extensible. Moreover, we propose a visualization scheme based on a client/server model which separates the graphical user interface (GUI) from the simulation engine, and therefore the scalability of the simulator will not be decreased. The performance of EasiSim is evaluated through extensive simulations and compared with ns-2 in terms of real running time and memory usage. The results show that EasiSim takes less time and less memory than ns-2 to complete simulations with the same number of nodes during a same configured simulation time.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115646385","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
扫码关注我们
求助内容：
应助结果提醒方式：