Context Aware Service Oriented Computing in Mobile Ad Hoc Networks

These days we witness a major shift towards small, mobile devices, capable of wireless communication. Their communication capabilities enable them to form mobile ad hoc networks and share resources and capabilities. Service Oriented Computing (SOC) is a new emerging paradigm for distributed computing that has evolved from object-oriented and component-oriented computing to enable applications distributed within and across organizational boundaries. Services are autonomous computational elements that can be described, published, discovered, and orchestrated for the purpose of developing applications. The application of the SOC model to mobile devices provides a loosely coupled model for distributed processing in a resource-poor and highly dynamic environment. Cooperation in a mobile ad hoc environment depends on the fundamental capability of hosts to communicate with each other. Peer-to-peer interactions among hosts within communication range allow such interactions but limit the scope of interactions to a local region. Routing algorithms for mobile ad hoc networks extend the scope of interactions to cover all hosts transitively connected over multi-hop routes. Additional contextual information, e.g., knowledge about the movement of hosts in physical space, can help extend the boundaries of interactions beyond the limits of an island of connectivity. To help separate concerns specific to different layers, a coordination model between the routing layer and the SOC layer provides abstractions that mask the details characteristic to the network layer from the distributed computing semantics above. This thesis explores some of the opportunities and challenges raised by applying the SOC paradigm to mobile computing in ad hoc networks. It investigates the implications of disconnections on service advertising and discovery mechanisms. It addresses issues related to code migration in addition to physical host movement. It also investigates some of the security concerns in ad hoc networking service provision. It presents a novel routing algorithm for mobile ad hoc networks and a novel coordination model that addresses space and time explicitly

Mobile ad hoc networks for intelligent systems

Advances in wireless technology and portable computing along with demands for high user mobility have provided a major promotion toward the development of ad hoc networks. Mobile ad hoc networks feature dynamic topology, self-organization, limited bandwidth and battery power of a node. They do not rely on specialized routers for path discovery and traffic routing. Research on ad hoc networks has been extensively investigated in the past few years and related work has focused on many of the layers of the communications architecture. This research intends to investigate applications of MANET for intelligent systems, including intelligent transportation system (ITS), sensor network and mobile intelligent robot network, and propose some approaches to topology management, link layer multiple access and routing algorithms. Their performance is evaluated by theoretical analysis and off-the-shelf simulation tools. Most current research on ad hoc networks assumes the availability of IEEE 802.11. However, the RTS/CTS protocol of 802.11 still leads to packet collision which in turn decreases the network throughput and lifetime. For sensor networks, sensors are mostly battery operated. Hence, resolving packet collision may improve network lifetime by saving valuable power. Using space and network diversity combination, this work proposes a new packet separation approach to packet collision caused by masked nodes. Inter-vehicle communication is a key component of ITS and it is also called vehicular ad hoc network. VANET has many features different from regular MANETs in terms of mobility, network size and connectivity. Given rapid topology changes and network partitioning, this work studies how to organize the numerous vehicular nodes and establish message paths between any pair of vehicular nodes if they are not apart too far away. In urban areas, the inter-vehicle communication has different requirements and constraints than highway environments. The proposed position-based routing strategy for VANETs utilizes the traffic pattern in city environments. Packets are forwarded based on traffic lights timing sequence and the moving direction of relaying vehicles. A multicast protocol is also introduced to visualize the real time road traffic with customized scale. Only vehicles related to a source node\u27s planned trajectory will reply the query packet. The visualized real time traffic information therefore helps the driver make better decision in route planning when traffic congestion happens. Nowadays robots become more and more powerful and intelligent. They can take part in operations in a cooperative manner which makes distributed control necessary. Ad hoc robot communication network is still fresh field for researchers working on networking technology. This work investigates some key issues in robot ad hoc network and evaluate the challenges while establishing robot ad hoc networks

Adaptive resource allocation for cognitive wireless ad hoc networks

Widespread use of resource constrained wireless ad hoc networks requires careful management of the network resources in order to maximize the utilization. In cognitive wireless networks, resources such as spectrum, energy, communication links/paths, time, space, modulation scheme, have to be managed to maintain quality of service (QoS). Therefore in the first paper, a distributed dynamic channel allocation scheme is proposed for multi-channel wireless ad hoc networks with single-radio nodes. The proposed learning scheme adapts the probabilities of selecting each channel as a function of the error in the performance index at each step. Due to frequent changes in topology and flow traffic over time, wireless ad hoc networks require a dynamic routing protocol that adapts to the changes of the network while allocating network resources. In the second paper, approximate dynamic programming (ADP) techniques are utilized to find dynamic routes, while solving discrete-time Hamilton-Jacobi-Bellman (HJB) equation forward-in-time for route cost. The third paper extends the dynamic routing to multi-channel multi-interface networks which are affected by channel uncertainties and fading channels. By the addition of optimization techniques through load balancing over multiple paths and multiple wireless channels, utilization of wireless channels throughout the network is enhanced. Next in the fourth paper, a decentralized game theoretic approach for resource allocation of the primary and secondary users in a cognitive radio networks is proposed. The priorities of the networks are incorporated in the utility and potential functions which are in turn used for resource allocation. The proposed game can be extended to a game among multiple co-existing networks, each with different priority levels --Abstract, page iv

Capacity of Wireless Ad Hoc Networks with Opportunistic Collaborative Communications

Optimal multihop routing in ad hoc networks requires the exchange of control messages at the MAC and network layer in order to set up the (centralized) optimization problem. Distributed opportunistic space-time collaboration (OST) is a valid alternative that avoids this drawback by enabling opportunistic cooperation with the source at the physical layer. In this paper, the performance of OST is investigated. It is shown analytically that opportunistic collaboration outperforms (centralized) optimal multihop in case spatial reuse (i.e., the simultaneous transmission of more than one data stream) is not allowed by the transmission protocol. Conversely, in case spatial reuse is possible, the relative performance between the two protocols has to be studied case by case in terms of the corresponding capacity regions, given the topology and the physical parameters of network at hand. Simulation results confirm that opportunistic collaborative communication is a promising paradigm for wireless ad hoc networks that deserves further investigation

A RADIAL BASIS NEURAL NETWORK CONTROLLER TO SOLVE CONGESTION IN WIRELESS SENSOR NETWORKS

In multihop networks, such as the Internet and the Mobile Ad-hoc Networks, routing is one of the most importantissues that has an important effect on the network’s performance. This work explores the possibility of using the shortest path routingin wireless sensor network . An ideal routing algorithm should combat to find an perfect path for data that transmitted within anexact time. First an overview of shortest path algorithm is given. Then a congestion estimation algorithm based on multilayerperceptron neural networks (MLP-NNs) with sigmoid activation function, (Radial Basis Neural Network Congestion Controller(RBNNCC) )as a controller at the memory space of the base station node. The trained network model was used to estimate trafficcongestion along the selected route. A comparison study between the network with and without controller in terms of: trafficreceived to the base station, execution time, data lost, and memory utilization . The result clearly shows the effectiveness of RadialBasis Neural Network Congestion Controller (RBNNCC) in traffic congestion prediction and control

Self-stabilizing ring networks on connected graphs

Large networks require scalable routing. Traditionally, protocol overhead is reduced by introducing a hierarchy. This requires aggregation of nearby nodes under a common address prefix. In fixed networks, this is achieved administratively, whereas in wireless ad-hoc networks, dynamic assignments of nodes to aggregation units are required. As a result of the nodes commonly being assigned a random network address, the majority of proposed ad-hoc routing protocols discovers routes between end nodes by flooding, thus limiting the network size. Peer-to-peer (P2P) overlay networks offer scalable routing solutions by employing virtualized address spaces, yet assume an underlying routing protocol for end-to-end connectivity. We investigate a cross-layer approach to P2P routing, where the virtual address space is implemented with a network-layer routing protocol by itself. The Iterative Successor Pointer Rewiring Protocol (ISPRP) efficiently initializes a ring-structured network among nodes having but link-layer connectivity. It is fully self-organizing and issues only a small per-node amount of messages by keeping interactions between nodes as local as possible. The main contribution of this paper is a proof that ISPRP is self-stabilizing, that is, starting from an arbitrary initial state, the protocol lets the network converge into a correct state within a bounded amount of time

Multi Hop Transmission in IEEE 802.11 Low Rate Ad Hoc Network Using ARP-Route

Ad hoc networks are becoming more important in the modern complex environment. The ad hoc network can be used to instantly connect to the local or remote networks such as the Internet without the need of pre-existing infrastructure or centralized administration. The users of the network together will establish the infrastructure. The disadvantage of wireless communication is that it has limited range of radio transmission. Due to this, multiple network ‘hops’ are needed for one device to exchange data with another device across the network. In an ad hoc network, these devices will not only operate as a host but also as a router to forward the packets. There are varieties of routing protocols targeted for this environment that have been proposed and developed. However, most of them suffer from high overhead data traffic. The main purpose of this project is to implement the ad hoc network with the existing network protocol that had already been used in network environment which is the Address Resolution Protocol (ARP). ARP was designed to announce or find MAC addresses. The novelty of this study is that we have extended the usage of the ARP protocol to act as routing protocol in wireless ad hoc network. The ARP route provides two new operation types, ARP Forward Request and ARP Forward Reply to allow the multihop transmission using intermediate nodes to forward the request and reply. These two operation types only used the current operation codes which are ‘0x0001’ for request and ‘0x0002’ for reply. This work on the routing protocol creates a new operation code for the ARP forwarding scheme which is ‘0x000c’ for forwarding. We have successfully managed to create a multi hop transmission in an ad hoc network by using the current existing operation code for the ARP forwarding. The work scope focus only on proving that the method can be applied hence it is not necessarily to prove the effectiveness of this proposed method yet. Therefore, the outcome of the study shows that the data can be sent through multi hop transmission until it reaches the destination. The 802.11b test-bed has been configured and the ARP routing protocol has been implemented for multi hop transmission. The experiment in the open space provides the comparison of environment with obstacles and without obstacles. We manage to get more than 50% of packet receive at a place with no obstacles and more than 45% in a place with obstacles. The proof of method is shown by using several graphs namely in terms of time, packet loss and also throughput

Advances on Network Protocols and Algorithms for Vehicular Ad Hoc Networks

Vehicular Ad Hoc Network (VANET) is an emerging area of wireless ad hoc networks that facilitates ubiquitous connectivity between smart vehicles through Vehicle-to-Vehicle (V2V) or Vehicle-to-Roadside (V2R) and Roadside-to- Vehicle (R2V) communications. This emerging field of technology aims to improve safety of passengers and traffic flow, reduces pollution to the environment and enables in-vehicle entertainment applications. The safety-related applications could reduce accidents by providing drivers with traffic information such as collision avoidances, traffic flow alarms and road surface conditions. Moreover, the passengers could exploit an available infrastructure in order to connect to the internet for infomobility and entertainment applications.Lloret, J.; Ghafoor, KZ.; Rawat, DB.; Xia, F. (2013). Advances on Network Protocols and Algorithms for Vehicular Ad Hoc Networks. Mobile Networks and Applications. 18(6):749-754. doi:10.1007/s11036-013-0490-7S749754186Lloret J, Canovas A, Catalá A, Garcia M (2013) Group-based protocol and mobility model for VANETs to offer internet access. J Netw Comput Appl 36(3):1027–1038. doi: 10.1016/j.jnca.2012.02.009Khokhar RH, Zia T, Ghafoor KZ, Lloret J, Shiraz M (2013) Realistic and efficient radio propagation model for V2X communications. KSII Trans Internet Inform Syst 7(8):1933–1953. doi: 10.3837/tiis.2013.08.011Ghafoor KZ (2013) Routing protocols in vehicular ad hoc networks: survey and research challenges, Netw Protocol Algorithm 5(4). doi: 10.5296/npa.v5i4.4134Ghafoor KZ, Bakar KA, Lloret J, Ke C-H, Lee KC (2013) Intelligent beaconless geographical routing for urban vehicular environments. Wirel Netw 19(3):345–362. doi: 10.1007/s11276-012-0470-zGhafoor KZ, Bakar KA, Lee K, AL-Hashimi H (2010) A novel delay- and reliability- aware inter-vehicle routing protocol. Netw Protocol Algorithms 2(2):66–88. doi: 10.5296/npa.v2i2.427Dias JAFF, Rodrigues JJPC, Isento JN, Pereira PRBA, Lloret J (2011) Performance assessment of fragmentation mechanisms for vehicular delay-tolerant networks. EURASIP J Wirel Commun Netw 2011(195):1–14. doi: 10.1186/1687-1499-2011-195Zhang D, Yang Z, Raychoudhury V, Chen Z, Lloret J (2013) An energy-efficient routing protocol using movement trend in vehicular Ad-hoc networks. Comput J 58(8):938–946. doi: 10.1093/comjnl/bxt028Ghafoor KZ, Lloret J, Bakar KA, Sadiq AS, Mussa SAB (2013) Beaconing approaches in vehicular Ad Hoc networks: a survey. Wirel Pers Commun. doi: 10.1007/s11277-013-1222-9Sadiq AS, Bakar KA, Ghafoor KZ, Lloret J (2013) An intelligent vertical handover scheme for audio and video streaming in heterogeneous vehicular networks. Mobile Netw Appl. doi: 10.1007/s11036-013-0465-8Khamayseh YM (2013) Network size estimation in VANETs. Netw Protocol Algorithm 5(3):136–152. doi: 10.5296/npa.v5i6.3838Rawat DB, Popescu DC, Yan G, Olariu S (2011) Enhancing VANET performance by joint adaptation of transmission power and contention window size. IEEE Trans Parallel Distrib Syst 22(9):1528–1535Yan G, Rawat DB, Bista BB. Provisioning vehicular ad hoc networks with quality of services. Int J Space-Based Situated Comput 2(2):104–111Rawat DB, Bista BB, Yan G, Weigle MC (2011) Securing vehicular ad-hoc networks against malicious drivers: a probabilistic approach, International Conference on Complex, Intelligent, and Software Intensive Systems Pp. 146–151. June 30, 2011Sun W, Xia F, Ma J, Fu T, Sun Y. An optimal ODAM-based broadcast algorithm for vehicular Ad-Hoc Networks. KSII Trans Internet Inform Syst 6(12): 3257–3274Vinel AV, Dudin AN, Andreev SD, Xia F (2010) Performance modeling methodology of emergency dissemination algorithms for vehicular ad-hoc networks, 6th Communication Systems, Networks & Digital Signal Processing (CSNDSP 2010), Pp. 397–400AL-Hashimi HN, Bakar KA, Ghafoor KZ (2010) Inter-domain proxy mobile IPv6 based vehicular network. Netw Protocol Algorithm 2(4):1–15. doi: 10.5296/npa.v2i4.488Ghafoor KZ, Bakar KA, Mohammed MA, Lloret J (2013) Vehicular cloud computing: trends and challenges, in the book “mobile computing over cloud: technologies, services, and applications”. IGI GlobalYan G, Rawat DB, Bista BB (2012) Towards secure vehicular clouds, Sixth International Conference on Complex, Intelligent and Software Intensive Systems (CISIS 2012), Pp. 370–375Fernández H, Rubio L, Reig J, Rodrigo-Peñarrocha VM, Valero A (2013) Path loss modeling for vehicular system performance and communication protocols evaluation. Mobile Netw Appl. doi: 10.1007/s11036-013-0463-xAllouche Y, Segal M (2013) A cluster-based beaconing approach in VANETs: near optimal topology via proximity information. Mobile Netw Appl. doi: 10.1007/s11036-013-0468-5Merah AF, Samarah S, Boukerche A, Mammeri A (2013) A sequential patterns data mining approach towards vehicular route prediction in VANETs. Mobile Netw Appl. doi: 10.1007/s11036-013-0459-6Zhang D, Huang H, Zhou J, Xia F, Chen Z (2013) Detecting hot road mobility of vehicular Ad Hoc Networks. Mobile Netw Appl. doi: 10.1007/s11036-013-0467-6El Ajaltouni H, Boukerche A, Mammeri A (2013) A multichannel QoS MAC with dynamic transmit opportunity for. Mobile Netw Appl. doi: 10.1007/s11036-013-0475-6Reñé S, Esparza O, Alins J, Mata-Díaz J, Muñoz JL (2013) VSPLIT: a cross-layer architecture for V2I TCP services over. Mobile Netw Appl. doi: 10.1007/s11036-013-0473-8Blanco B, Liberal F (2013) Amaia Aguirregoitia, application of cognitive techniques to adaptive routing for VANETs in city environments. Mobile Netw Appl. doi: 10.1007/s11036-013-0466-7Kim J, Krunz M (2013) Spectrum-aware beaconless geographical routing protocol for cognitive radio enabled vehicular networks. Mobile Netw Appl. doi: 10.1007/s11036-013-0476-5Dias JAFF, Rodrigues JJPC, Isento JNG, Niu J (2013) The impact of cooperative nodes on the performance of vehicular delay-tolerant networks. Mobile Netw Appl. doi: 10.1007/s11036-013-0464-9Sadiq AS, Bakar KA, Ghafoor KZ, Lloret J, Khokhar R (2013) An intelligent vertical handover scheme for audio and video streaming in heterogeneous vehicular networks. Mobile Netw Appl. doi: 10.1007/s11036-013-0465-8Machado S, Ozón J, González AJ, Ghafoor KZ (2013) Structured peer-to-peer real time video transmission over vehicular Ad Hoc networks. Mobile Netw Appl. doi: 10.1007/s11036-013-0461-zLin C, Wu G, Xia F, Yao L (2013) Enhance the attacking efficiency of the node compromise attack in vehicular Ad-hoc network using connected dominating set. Mobile Netw Appl. doi: 10.1007/s11036-013-0469-