Welcome to the second installment of IJBDCN. This issue contains three research papers and a comprehensive survey article on mobile ad hoc networks. We would like to publish a couple of survey or tutorial articles per year as we believe this to be of value to our readers. Many research papers are necessarily focused and do not allow for a " panoramic " view of a particular subject. This is the gap that well-written survey or tutorial papers can fill. We are also planning a guest-edited special issue for the last quarter of this year and welcome your suggestions for future special issues of the journal. This second issue starts with a paper entitled " An Approach to Solving the Surviv-able Capacitated Network Design Problem " where Sridhar and Park studied the problem of selecting links of a network to construct primary and secondary routes for transfer of commodity traffic between nodes of the network. Their technique allows the design of survivable and cost-effective networks. In the second paper, " Query Processing Strategies for Location-Dependent Information Services " , Jayaputera and Taniar propose a new approach to generate a query result for location-dependent information services (LDIS). They argue that choosing a square as the scope of a query and dividing it into four equal regions, where a user is a center point of the scope, results in a faster searching time to find targets queried and brings a bigger chance to get rare targets. In addition, by avoiding resubmitting the same queries when the query results missed, the approach reduced bandwidth use at both the server and client sides. The third paper, " Addressing SPAM E-Mail Using Hashcash " by Curran and Honan tackles a problem experienced by most of us. The authors present the Hashcash proof-of-work approach and investigate the feasibility of implementing a solution based on that mechanism along with what they called a " cocktail " of antispam measures designed to keep junk mail under control. Finally , in the last paper, entitled " MANET: Applications, Issues, and Challenges for the Future " , Dhar presents an informative survey of mobile ad hoc networks, describing the main characteristics of those networks and how they are being used, and discussing the most pressing issues and challenges associated with these temporary wireless networks. We hope that you enjoy this and the upcoming issues of IJBDCN. Our goal is to …

International Journal of Business Data Communications and Networking

The study of systems and architectures for ambient assisted living (AAL) is undoubtedly a topic of great relevance given the ageing of the world population. On the one hand, AAL technologies are designed to meet the needs of the ageing population in order to maintain their independence as long as possible. On the other hand, internet of things (IoT) proposes that various “things,” which include not only communication devices but also every other physical object on the planet, are going to be connected and will be controlled across the internet. The continuous technological advancements turn possible to build smart objects with great capabilities for sensing and connecting turn possible several advancements in AAL and IoT systems architectures. Advances in networking, sensors, and embedded devices have made it possible to monitor and provide assistance to people in their homes. This chapter reviews the state of art on AAL and IoT and their applications for enhanced indoor living environments and occupational health.

Ambient Assisted Living and Internet of Things

Wireless sensor networks comprise of vast numbers of sensor nodes deployed to monitor a particular event fire, intrusion, etc. or measure a parameter like temperature, pressure value representative of the physical condition of the ambient environment. There is a growing need of using energy-efficient data gathering algorithms that can effectively aggregate the monitored/measured data from the individual sensor nodes through a properly constructed communication topology and transmit a single representative data to a control center sink that is typically located far away from the network field. In order to maximize node lifetime and be fair to all nodes in the network, such a communication topology has to be dynamically constructed for every round of data gathering by taking into consideration available energy levels of sensor nodes. This paper presents a comprehensive description of two broad categories of data gathering algorithms for wireless sensor networks-the classical algorithms that are not energy-aware and modern energy-aware data gathering algorithms. These algorithms can also be classified based on the communication topology they choose to construct and use for data gathering. The authors also present an extensive simulation study that demonstrates the individual as well as the comparative performance of these data gathering algorithms.

A Comprehensive Review and Performance Analysis of Data Gathering Algorithms for Wireless Sensor Networks

The authors describe a methodology for evaluating the performability (combined performance and reliability) of large communications networks. Networks are represented by a 4-level hierarchical model, consisting of traffic matrix, network graph, â€œcomponentsâ€ representing failure modes, and reliability information. Network states are assignments of modes to the network components, which usually represent network elements and their key modules, although they can be more abstract. The components can be binary or multi-modal, and each of their failure modes may change a set of attributes of the graph (e.g. the capacity or cost of a link). Their methodology also captures the effect of automatic restoration against network failures by including two common rerouting methods. To compute network performability measures, including upper and lower bounds on their cumulative distribution functions, we augment existing probabilistic state-space generation algorithms with our new â€œhybridâ€ algorithm. To characterize the network failures of highest impact, we compute the Pareto boundaries of the networkâ€™s risk space. The authors have developed a network analysis tool called nperf that embodies this methodology. To illustrate the methodology and the practicality of the tool, they describe a performability analysis of three design alternatives for a large commercial IP backbone network.

Multi-Layer Network Performance and Reliability Analysis

Video streaming over vehicular networks is an attractive feature to many applications, such as emergency video transmission and inter-vehicle video transmission. Vehicles accessing road-side units have a few seconds to download information and experience a high packet loss rate. Hence, this paper proposes Cooperative Error Control CEC mechanism combining Cognitive Technology CT for video streaming over wireless vehicular networks. CEC mechanism combining CT uses a cooperative error recover scheme to recover lost packets not only from a road-side unit which uses the primary channel but also from the other vehicles using a free channel. Hence, CEC mechanism with CT can enhance error recovery performance and quality of video streaming over vehicular networks. Simulation results show the error recover performance of the CEC mechanism combining CT performs better than the other related mechanisms.

Cooperative Error Control Mechanism Combining Cognitive Technology for Video Streaming Over Vehicular Networks

Cellular IP network deals with micro mobility of the mobile devices. An important challenge in wireless communication, especially in cellular IP based network, is to provide good Quality of Service (QoS) to the users in general and to the real-time users (users involved in the exchange of real-time packets) in particular. Reserving bandwidth for real time traffic to minimize the connection drop (an important parameter) is an activity often used in Cellular IP network. Particle Swarm Optimization (PSO) algorithm simulates the social behavior of a swarm or flock to optimize some characteristic parameter. PSO is effectively used to solve many hard optimization problems. The work, in this paper, proposes an on demand bandwidth reservation scheme to improve Connection Dropping Probability (CDP) in cellular IP network by employing PSO. The swarm, in the model, consists of the available bandwidth in the seven cells of the cellular IP network. The anytime bandwidth demand for real-time users is satisfied by the available bandwidth of the swarm. The algorithm, used in the model, searches for the availability of the bandwidth and reserves it in the central cell of the swarm. Eventually, it will allocate it on demand to the cell that requires it. Simulation experiments reveal the efficacy of the model. [Article copies are available for purchase from InfoSci-on-Demand.com]

On Demand Bandwidth Reservation for Real-Time Traffic in Cellular IP Network using Particle Swarm Optimization

Cellular IP networks deal with the concepts of micro-mobility. Buffer management in Cellular IP networks is very crucial as its proper usage not only increases the throughput of the network but also results in the reduction of the call drops. This article proposes a model for buffer management in Cellular IP network using Particle Swarm Optimization (PSO), an evolutionary computational method often used to solve hard problems. The model considers two kinds of buffers; Gateway buffer and Base Station buffer. In the proposed two-tier model, the first tier applies a prioritization algorithm for prioritizing real-time packets in the buffer. In the second tier PSO algorithm is used on a swarm of cells in the network. PSO is applied for a given time slot, called window. In each window period the swarm can store number of packets depending on the window size and the total number of packets. The effect of various parameters e.g. number of packets, size of packets, window size, and a threshold value on buffer utilization has been studied by conducting the simulation experiments. [Article copies are available for purchase from InfoSci-on-Demand.com]

Buffer Management in Cellular IP Network using PSO

A Cellular IP CIP network involves a bulk of data transmission. It is highly reliable and guarantees the safe delivery of the packets required in such systems. Reliable traffic performance leads to efficient and reliable connectivity in Cellular IP network. CIP network, which consists of mobile hosts, base stations, and links, are often vulnerable and prone to failure. During the routing operation in the network, the base station, which works as router for the transmitted packets, may fail to perform. Reliable transmission is desirable, in terms of services of the base stations in the network, reliable routing, and processing the data. In this paper, the authors design a reliability model to increase the reliability of a flow, consisting of packets, passing through routers in a Cellular IP network. Particle Swarm Optimization PSO is able to solve a class of complex optimization problems. PSO is used to improve the reliability of the flow in CIP network. The proposed model studies the effects of packet processing rate, packet arrival rate, and the number of packets per flow on the reliability of the system. A simulation experiment is conducted and results reveal the effectiveness of the model.

Maximizing the Flow Reliability in Cellular IP Network Using PSO

Real-time traffic in Cellular IP network is considered to be important and therefore given priority over non-real-time. Buffer is an important but scarce resource and to optimize Quality of Service by managing buffers of the network is an important and complex problem. Evolutionary Algorithms are quite useful in solving such complex optimization problems, and in this regard, a two-tier model for buffer, Gateway and Base Station, management in Cellular IP network has been propsed. The first tier applies a prioritization algorithm for prioritizing real-time packets in the buffer of the gateway with a specified threshold. Packets which couldn't be served, after the threshold, is given to the nearest cells of the network to be dealt with in the second tier, while Evolutionary Algorithm (EA) based procedures are applied in order to optimally store these packets in the buffer of the base stations. Experiments have been conducted to observe the performance of the proposed models and a comparative study of the models, GA based and PSO based, has been carried out to depict the advantage and disadvantage of the proposed models.

Buffer Management in Cellular IP Networks using Evolutionary Algorithms

Providing QoS is one of the important issues in order to improve the performance of Cellular IP network. Resource reservation is often used in achieving this goal and it is proven to be an effective mechanism so far. Resources of Cellular IP network that can be reserved are bandwidth, buffer and CPU cycles. This paper is proposing a model for router CPU cycle reservation for real-time flows in Cellular IP network. The model applies Particle Swarm Optimization, as a soft computing tool, to reserve the CPU cycles and reduce the flow processing time at each router in the route taken by a flow. Simulation experiments reveal the efficacy of the model.

http://www.aicit.org/IJACT/ppl/compiled4_Part7.pdf

Mohammad Anbar

Papers

On Demand Bandwidth Reservation for Real-Time Traffic in Cellular IP Network using Particle Swarm Optimization

Buffer Management in Cellular IP Network using PSO

Maximizing the Flow Reliability in Cellular IP Network Using PSO

Buffer Management in Cellular IP Networks using Evolutionary Algorithms

Router CPU Time Management using Particle Swarm Optimization in Cellular IP Networks