Editorial
|
| Title | Editorial |
| Authors | |
| Abstract | This special issue comprises seven selected papers from the International Symposium on Electronic Commerce Security (ISECS 2008), held in Guangzhou, China, 3-5 August 2008. A total of 643 contributions were submitted to this Conference, of which 227 were selected for presentation after a rigorous review process. From these 227 research papers, the guest editors selected seven as the best papers on the communications track of the Conference. The authors of these selected papers produced extended versions of their conference papers, which were further developed through two rounds of reviewing. “A Node Encoding of Torus Topology and Its Improved Routing Algorithm”, by Xiaoqiang Yang, Junmin Li, Huimin Du, and Jungang Han, analyzes the topology and the node code of Network-on-Chip (NoC), and proposes a two-dimensional code based on Johnson Code, which implies the relation between neighbouring nodes and their links and the global information of routing. Two methods for code compressing are also presented to reduce the storage space of node address and increase. The improved algorithm for X-Y routing is described and implemented with three or six logic operations in middle nodes, and the node structure of NoC is designed. “An Effective Approach for Live Media Streaming Based on BitTorrent”, by Qingchao Cai and Xuejie Zhang, proposes a solution that incorporates BitTorrent Mechanism into P2P Streaming. The paper gives a simple description of BitTorrent protocol and analyzes the problems encountered while importing it into P2P streaming. To address the problems, the authors propose some modifications to BitTorrent protocol, including to prioritize the pieces based on their playback deadline, to redefining source behavior, and to import block-level tit-for-tat policy and periodical examination of active neighbors to avoid low start. In the paper “A Hexagon-based Key Pre-distribution Scheme for Large Scale Static Wireless Sensor Networks”, Xuanxia Yao, Xuefeng Zheng, and Tao Wu address the problem of improving the secure connectivity and expansibility of static wireless sensor networks, to decrease the memory costs of sensor nodes. They propose an efficient hexagon-based key pre-distribution scheme, by employing the ideas of the grouping key management and secret binding. In this scheme, the process of establishing pair-wise keys for neighboring nodes in the network is limited in the beginning of the network deployment, and when adding new sensor nodes into the network, the pair-wise key establishment for the new nodes and their neighbors needs to be verified by the base-station. In addition, the most appropriate value of the cell’s radius is found in the paper, which can optimize the proposed schemes in terms of secure connectivity and memory costs. “An Energy Optimization Protocol Based on Cross-Layer for Wireless Sensor Networks”, by Yuebin Bai, Shujuan Liu, Mo Sha, Yang Lu, and Cong Xu, proposes for wireless sensor networks a cross-layer based Energy Optimization Approach (EOA) that considers the joint optimal design of the physical, medium access control (MAC), and routing layer. The focus of EOA is on the computation of optimal transmission power, routing, and duty-cycle schedule. EOA is validated on a Crossbow’s MicaZ mote platform, and evaluated using the TOSSIM simulator. In “In-Field Attack Proof of Injected False Data in Sensor Networks”, Zheng Wang, Xiaodong Lee, Xinchang Zhang, and Baoping Yan address the problem of detecting false sensing reports that can be injected by compromised nodes in a wireless sensor network. They present an in-field attack proof (IAP) mechanism that exploits the sheer scale and dense deployment of large sensor networks and the shape of signal strength field formed by detecting nodes. To prevent any in-field compromised node from breaking down the entire system, IAP carefully designs the MAC routing mechanism so that the report generated by the node can be detected and dropped en-route. “A Cooperative Secure Routing Protocol based on Reputation System for Ad Hoc Networks”, by Yihui Zhang, Li Xu, and Xiaoding Wang, proposes a cooperative secure routing protocol to prevent and detect malicious attacks and selfish behaviors. It adopts a robust and efficient reputation system to help enforce the security and cooperation of the routing protocol. The protocol is based on ARAN, but it is proven to be more efficient and more secure than normal ARAN secure routing protocol in defending against both malicious and authenticated selfish nodes. In the last paper “Cover-Free Family based Efficient Group Key Management Strategy in Wireless Sensor Network”, Li Xu, Jianwei Chen, and Xiaoding Wang address the problem of secure group re-keying for wireless sensor networks. They presented PDGRS, a new t-packing design based group re-keying scheme for sensor networks, which focuses on key distribution and update for secure group communication. They use Latin squares to construct orthogonal arrays in key pre-distribution phase in order to quickly obtain t-packing designs. Then the pre-deployed keys are used for implementing secure channels between members for group key distribution. In closing, we would like to take this opportunity to thank the authors for the efforts they put in the preparation of the manuscripts and in keeping the deadlines set by editorial requirements. We wish to express our deepest thanks to the program committee members for their help in selecting papers for this issue and especially the referees of the extended versions of the selected papers for their thorough reviews under a tight time schedule. We also acknowledge the exceptional effort by the Editorial Board of the Journal of Communications throughout this process. We hope that you will enjoy reading this special issue as much as we did putting it together. |
| Publisher | ACADEMY PUBLISHER |
| Date | 2008-11-01 |
| Source | Journal of Communications Vol 3, No 6 (2008): Special Issue: Selected Best Papers of International Symposium on Electronic Co |
| Rights | Copyright © ACADEMY PUBLISHER - All Rights Reserved.To request permission, please check out URL: http://www.academypublisher.com/copyrightpermission.html. |