Power saving in sensor networks via mobile base station repositioning

This research investigated the effect of dynamically repositioning the geographic location of a mobile base station within a sensor network in order to reduce energy consumption and increase network lifetime. Through simulation and experimental methodology, the proposed approach outperformed existing methods by extending network lifetime whilst reducing energy consumption.

S-Kcore : a social-aware Kcore decomposition algorithm in pocket switched networks

The key nodes in network play the critical role in system recovery and survival. Many traditional key nodes selection algorithms utilize the characters of the physical topology to find the key nodes. But they can hardly succeed in the mobile ad hoc network due to the mobility nature of the network. In this paper we propose a social-aware Kcore selection algorithm to work in the Pocket Switched Network. The social view of the network suggests the social position of the mobile nodes can help to find the key nodes in the Pocket Switched Network. The S-Kcore selection algorithm is designed to exploit the nodes' social features to improve the performance in data communication. Experiments use the NS2 shows S-Kcore selection algorithm workable in the Pocket Switched Network. Furthermore, with the social behavior information, those key nodes are more suitable to represent and improve the whole network's performance.

Secure connectivity model in wireless sensor networks (WSN) using first order Reed-Muller codes

In this paper, we suggest the idea of separately treating the connectivity and communication model of a Wireless Sensor Network (WSN). We then propose a novel connectivity model for a WSN using first order Reed-Muller Codes. While the model has a hierarchical structure, we have shown that it works equally well for a Distributed WSN. Though one can use any communication model, we prefer to use the communication model suggested by Ruj and Roy [1] for all computations and results in our work. Two suitable secure (symmetric) cryptosystems can then be applied for the two different models, connectivity and communication respectively. By doing so we have shown how resiliency and scalability are appreciably improved as compared to Ruj and Roy [1].

A simple motion heuristic for controlling mobile sinks in delay tolerant sensor networks

Optimising energy consumption in wireless sensor networks is of dominant importance. Sink mobility is introduced to deal with this problem by approaching the sensor nodes and collecting their data buffers using the less energy demanding single-hop communication. The sink route is very crucial for the data collection operation performed in the network especially when the collection requests generated by the sensors are revealed dynamically to the sink and not known ahead. This paper presents a practical motion heuristic for constructing the sink route based on the dynamic arrival of the collection requests. Three control schemes are proposed for coordinating the interaction of multiple mobile sinks collectively performing the data collection in the network. The main objective is maximising the data collected by each mobile sink while minimising the sleeping time of each sensor awaiting the collection service. Simulation results show the performance of the mobile sinks under the proposed control schemes and the impact of the motion heuristic on the sensors' sleeping time in the network.

Multicast lifetime maximization using network coding in lossy wireless ad-hoc networks

In traditional stop-and-wait strategy for reliable communications, such as ARQ, retransmission for the packet loss problem would incur a great number of packet transmissions in lossy wireless ad-hoc networks. We study the reliable multicast lifetime maximization problem by alternatively exploring the random linear network coding in this paper. We formulate such problem as a min-max problem and propose a heuristic algorithm, called maximum lifetime tree (MLT), to build a multicast tree that maximizes the network lifetime. Simulation results show that the proposed algorithms can significantly increase the network lifetime when compared with the traditional algorithms under various distributions of error probability on lossy wireless links.

Unicast and broadcast throughput maximization in amplify-and-forward relay networks

Cooperative communication (CC) offers an efficient and low-cost way to achieve spatial diversity by forming a virtual antenna array among single-antenna nodes that cooperatively share their antennas. It has been well recognized that the selection of relay nodes plays a critical role in the performance of CC. Most existing relay selection strategies focus on optimizing the outage probability or energy consumption. To fill in the vacancy of research on throughput improvement via CC, we study the relay selection problem with the objective of optimizing the throughput in this paper. For unicast, it is a P problem, and an optimal relay selection algorithm is provided with a correctness proof. For broadcast, we show the challenge of relay selection by proving it nonprobabilistic hard (NP-hard). A greedy heuristic algorithm is proposed to effectively choose a set of relay nodes that maximize the broadcast throughput. Simulation results show that the proposed algorithms can achieve high throughput under various network settings.

Guest editorial : In Journal of networks, v.7 n.3

Networking of computing devices has been going through rapid evolution and thus continuing to be an ever expanding area of importance in recent years. New technologies, protocols, services and usage patterns have contributed to the major research interests in this area of computer science. The current special issue is an effort to bring forward some of these interesting developments that are being pursued by researchers at present in different parts of the globe. Our objective is to provide the readership with some insight into the latest innovations in computer networking through this. This Special Issue presents selected papers from the thirteenth conference of the series (ICCIT 2010) held during December 23-25, 2010 at the Ahsanullah University of Science and Technology. The first ICCIT was held in Dhaka, Bangladesh, in 1998. Since then the conference has grown to be one of the largest computer and IT related research conferences in the South Asian region, with participation of academics and researchers from many countries around the world. Starting in 2008 the proceedings of ICCIT are included in IEEExplore. In 2010, a total of 410 full papers were submitted to the conference of which 136 were accepted after reviews conducted by an international program committee comprising 81 members from 16 countries. This was tantamount to an acceptance rate of 33%. From these 136 papers, 14 highly ranked manuscripts were invited for this Special Issue. The authors were advised to enhance their papers significantly and submit them to undergo review for suitability of inclusion into this publication. Of those, eight papers survived the review process and have been selected for inclusion in this Special Issue. The authors of these papers represent academic and/or research institutions from Australia, Bangladesh, Japan, Korea and USA. These papers address issues concerning different domains of networks namely, optical fiber communication, wireless and interconnection networks, issues related to networking hardware and software and network mobility. The paper titled “Virtualization in Wireless Sensor Network: Challenges and Opportunities” argues in favor of bringing in different heterogeneous sensors under a common virtual framework so that the issues like flexibility, diversity, management and security can be handled practically. The authors Md. Motaharul Islam and Eui-Num Huh propose an architecture for sensor virtualization. They also present the current status and the challenges and opportunities for further research on the topic. The manuscript “Effect of Polarization Mode Dispersion on the BER Performance of Optical CDMA” deals with impact of polarization mode dispersion on the bit error rate performance of direct sequence optical code division multiple access. The authors, Md. Jahedul Islam and Md. Rafiqul Islam present an analytical approach toward determining the impact of different performance parameters. The authors show that the bit error rate performance improves significantly by the third order polarization mode dispersion than its first or second order counterparts. The authors Md. Shohrab Hossain, Mohammed Atiquzzaman and William Ivancic of the paper “Cost and Efficiency Analysis of NEMO Protocol Entities” present an analytical model for estimating the cost incurred by major mobility entities of a NEMO. The authors define a new metric for cost calculation in the process. Both the newly developed metric and the analytical model are likely to be useful to network engineers in estimating the resource requirement at the key entities while designing such a network. The article titled “A Highly Flexible LDPC Decoder using Hierarchical Quasi-Cyclic Matrix with Layered Permutation” deals with Low Density Parity Check decoders. The authors, Vikram Arkalgud Chandrasetty and Syed Mahfuzul Aziz propose a novel multi-level structured hierarchical matrix approach for generating codes of different lengths flexibly depending upon the requirement of the application. The manuscript “Analysis of Performance Limitations in Fiber Bragg Grating Based Optical Add-Drop Multiplexer due to Crosstalk” has been contributed by M. Mahiuddin and M. S. Islam. The paper proposes a new method of handling crosstalk with a fiber Bragg grating based optical add drop multiplexer (OADM). The authors show with an analytical model that different parameters improve using their proposed OADM. The paper “High Performance Hierarchical Torus Network Under Adverse Traffic Patterns” addresses issues related to hierarchical torus network (HTN) under adverse traffic patterns. The authors, M.M. Hafizur Rahman, Yukinori Sato, and Yasushi Inoguchi observe that dynamic communication performance of an HTN under adverse traffic conditions has not yet been addressed. The authors evaluate the performance of HTN for comparison with some other relevant networks. It is interesting to see that HTN outperforms these counterparts in terms of throughput and data transfer under adverse traffic. The manuscript titled “Dynamic Communication Performance Enhancement in Hierarchical Torus Network by Selection Algorithm” has been contributed by M.M. Hafizur Rahman, Yukinori Sato, and Yasushi Inoguchi. The authors introduce three simple adapting routing algorithms for efficient use of physical links and virtual channels in hierarchical torus network. The authors show that their approaches yield better performance for such networks. The final title “An Optimization Technique for Improved VoIP Performance over Wireless LAN” has been contributed by five authors, namely, Tamal Chakraborty, Atri Mukhopadhyay, Suman Bhunia, Iti Saha Misra and Salil K. Sanyal. The authors propose an optimization technique for configuring the parameters of the access points. In addition, they come up with an optimization mechanism in order to tune the threshold of active queue management system appropriately. Put together, the mechanisms improve the VoIP performance significantly under congestion. Finally, the Guest Editors would like to express their sincere gratitude to the 15 reviewers besides the guest editors themselves (Khalid M. Awan, Mukaddim Pathan, Ben Townsend, Morshed Chowdhury, Iftekhar Ahmad, Gour Karmakar, Shivali Goel, Hairulnizam Mahdin, Abdullah A Yusuf, Kashif Sattar, A.K.M. Azad, F. Rahman, Bahman Javadi, Abdelrahman Desoky, Lenin Mehedy) from several countries (Australia, Bangladesh, Japan, Pakistan, UK and USA) who have given immensely to this process. They have responded to the Guest Editors in the shortest possible time and dedicated their valuable time to ensure that the Special Issue contains high-quality papers with significant novelty and contributions.

Service-oriented wireless sensor networks and an energy-aware mesh routing algorithm

Service-oriented wireless sensor networks (WSNs) are being paid more and more attention because service computing can hide complexity of WSNs and enables simple and transparent access to individual sensor nodes. Existing WSNs mainly use IEEE 802.15.4 as their communication specification, however, this protocol suite cannot support IP-based routing and service-oriented access because it only specifies a set of physical- and MAC-layer protocols. For inosculating WSNs with IP networks, IEEE proposed a 6LoWPAN (IPv6 over LoW Power wireless Area Networks) as the adaptation layer between IP and MAC layers. However, it is still a challenging task how to discover and manage sensor resources, guarantee the security of WSNs and route messages over resource-restricted sensor nodes. This paper is set to address such three key issues. Firstly, we propose a service-oriented WSN architectural model based on 6LoWPAN and design a lightweight service middleware SOWAM (service-oriented WSN architecture middleware), where each sensor node provides a collection of services and is managed by our SOWAM. Secondly, we develop a security mechanism for the authentication and secure connection among users and sensor nodes. Finally, we propose an energyaware mesh routing protocol (EAMR) for message transmission in a WSN with multiple mobile sinks, aiming at prolonging the lifetime of WSNs as long as possible. In our EAMR, sensor nodes with the residual energy lower than a threshold do not forward messages for other nodes until the threshold is leveled down. As a result, the energy consumption is evened over sensor nodes significantly. The experimental results demonstrate the feasibility of our service-oriented approach and lightweight middleware SOWAM, as well as the effectiveness of our routing algorithm EAMR.

Communities, networks, individuals : place, self and everyday life on the internet

In this paper, I review the long-established use of the concept of ‘community’ which attempts both to perceive and analyse the experience of human interaction, mediated by networked computing. Ever since this form of communication commenced, it was clear that it was no ‘bloodless technological ritual’ (Rheingold, 1994), but something much more deeply human and expressive. For many years, the conceptual apparatus of ‘community’ served as the primary means for understanding the limits and potentials of this activity. However, the recent rise of social networking and social media might cast doubt on the legitimacy of this contested term’s continued relevance. Thus, I move from community to self, via the network notation that has come now to dominate our terminologies. I seek to demonstrate that, as the Internet has become interleaved with everyday life to the point where there is no distinction, for many people, between online and offline, we need to think again about how and what community might mean. In doing so, I suggest that the relationship between self and others, mediated or otherwise, is always one of shared ‘place’ but that contemporary practices of social networking differ significantly in how that place is shared and the degree of collective effort required.

Virtual design studio via social networks

With the advent of social networks, it became apparent that the social aspect of designing and learning plays a crucial role in students’ education. The ease of communication, leadership opportunity, democratic interaction, teamwork, and the sense of community are some of the aspects that are now in the centre of design interaction. Online interactions, multimedia, mobile computing and face-to-face learning create blended learning environments to which some Virtual Design Studios (VDS) have reacted. On the sample of a design studio at Deakin University the paper discusses details of the Social Network VDS, its pedagogical implications to PBL, and presents how it is successful in empowering architectural students to collaborate and communicate design proposals that integrate a variety of skills, deep learning, and construction of knowledge. It studies the effectiveness of the generated social intelligence and explores the facilitation of students’ self-directed learning. Hereby the paper studies the construction of knowledge via social interaction and how blended learning environments foster motivation and information exchange.

Emerging wireless personal area networks(WPANs) : - An analysis of techniques, tools and threats

Wireless Personal Area Networks provide a pivotal role in local area network technology complementing traditional Wireless Local Area Network technologies. Bluetooth, ZigBee and NFC (Near Field Communications) have emerged as key WPAN technologies with UWB (Ultra Wide Band) standards currently evolving. They are however subject to the usual range of security vulnerabilities found in wireless LANs such as spoofing, snooping, man-in-the-middle, denial of service and other attacks. However security in WPANs is not as mature as it is in Wireless LANs and further work is needed in order to provide comparable protection. This paper examines a range of WPAN technologies and security issues and proposes protection mechanisms that can mitigate risk in each case. © 2012 IEEE.

Lessons from large-scale conservation networks in Australia

Australia has seen a rapid growth in the establishment of networks of lands managed for connectivity conservation across tenures, at landscape and sub-continental scales. Such networks go under a variety of names, including biosphere reserves, biolinks, wildlife corridors and conservation management networks. Their establishment has varied from state government-led initiatives to those initiated by non-government organizations and interested landholders. We surveyed existing major landscape scale conservation initiatives for successes, failures and future directions and synthesized common themes. These themes included scale, importance of social and economic networks, leadership, governance, funding, conservation planning, the role of protected areas and communication. We discuss the emergence of national policy relating to National Wildlife Corridors in Australia and the relationship of this policy to the long standing commitment to build a comprehensive, adequate and representative National Reserve System. Finally we outline areas for further research for connectivity conservation projects in Australia.

Recognising user identity in twitter social networks via text mining

Social networks have become a convenient and effective means of communication in recent years. Many people use social networks to communicate, lead, and manage activities, and express their opinions in supporting or opposing different causes. This has brought forward the issue of verifying the owners of social accounts, in order to eliminate the effect of any fake accounts on the people. This study aims to authenticate the genuine accounts versus fake account using writeprint, which is the writing style biometric. We first extract a set of features using text mining techniques. Then, training of a supervised machine learning algorithm to build the knowledge base is conducted. The recognition procedure starts by extracting the relevant features and then measuring the similarity of the feature vector with respect to all feature vectors in the knowledge base. Then, the most similar vector is identified as the verified account.