Bloom filter based secure and anonymous DSR protocol in wireless ad hoc networks

Wireless ad hoc networks, especially in the hostile environment, are vulnerable to traffic analysis which allows the adversary to trace the routing messages and the sensitive data packets. Anonymity mechanism in ad hoc networks is a critical securing measure method employed to mitigate these problems. In this paper, we propose a novel secure and anonymous source routing protocol, called SADSR, based on Dynamic Source Routing (DSR) for wireless ad hoc networks. In the proposed scheme, we use the pseudonym, pseudonym based cryptography and the bloom filter to establish secure and anonymous routing in wireless ad hoc networks. Compared to other anonymous routing protocol, SADSR is not only anonymous but also the secure in the routing discover process and data transmission process.

Trust mechanisms in wireless sensor networks : attack analysis and countermeasures

As the trust issue in wireless sensor networks is emerging as one important factor in security schemes, it is necessary to analyze how to resist attacks with a trust scheme. In this paper we categorize various types of attacks and countermeasures related to trust schemes in WSNs. Furthermore, we provide the development of trust mechanisms, give a short summarization of classical trust methodologies and emphasize the challenges of trust scheme in WSNs. An extensive literature survey is presented by summarizing state-of-the-art trust mechanisms in two categories: secure routing and secure data. Based on the analysis of attacks and the existing research, an open field and future direction with trust mechanisms in WSNs is provided.

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.

A mesh based anycast routing protocol for ad hoc networks

Ad hoc networks became a hot topic recently, but the routing algorithm of anycast in the ad hoc networks has not yet been much explored. In this paper, we propose a mesh-based anycast routing algorithm (MARP) for ad hoc networks. The proposed routing model is robust and reliable, which can solve the unsteady topology problem in ad hoc networks. The future work is discussed at the end of this paper.

Prediction based location aided routing for mobile ad hoc networks

Routing in ad hoc networks faces significant challenges due to node mobility and dynamic network topology. In this work we propose the use of mobility prediction to reduce the search space required for route discovery. A method of mobility prediction making use of a sectorized cluster structure is described with the proposal of the Prediction based Location Aided Routing (P-LAR) protocol. Simulation study and analytical results of P-LAR find it to offer considerable saving in the amount of routing traffic generated during the route discovery phase.

Beyond ethics : a community platform to secure moral integrity

Stakeholders perceive the role of accountants to reflect trust, honesty, impartiality, fairness and transparency. The aim of this paper is to explore avenues to strengthen the moral integrity of professional bodies and their members. The resulting recommendations include a community or "milieu" approach.

Quality-of-service routing for web-based multimedia servers

Quality-of-Service is an important issue in multimedia applications; so far most of the research focuses on bandwidth guarantee, few pays attention to the server performance guarantee. In this paper we pay more attention to the server performance guarantee under the prerequisite of guaranteed bandwidth quality. We take advantage of anycast to find the "best" multimedia server among a distributed server group in terms of bandwidth, the request will be submitted to the selected server, moreover, the selected server's neighbours' (all the servers with feasible paths) addresses are delivered to the selected server simultaneously. If the selected server can not guarantee the QoS for the request in terms of server performance, then a proposed QoS-Aware Server Load Deviation (QASLD) mechanism wiII be employed, which will deliver the request to one of its neighbours until there exists a suitable server that can guarantee the server performance for the request. Our experiments show that the proposed QASLD algorithm works well.

Mobility prediction based routing for minimizing control overhead in mobile ad hoc networks

Routing in ad hoc networks faces significant challenges due to node mobility and dynamic network topology. In this work we propose the use of mobility prediction to reduce the search space required for route discovery. A method of mobility prediction making use of a sectorized cluster structure is described with the proposal of the Prediction based Location Aided routing (P-LAR) protocol. Simulation study and analytical results of the of P-LAR find it to offer considerable saving in the amount of routing traffic generated during the route discovery phase.

A performance comparison of three wireless multi hop ad-hoc network routing protocols when streaming MPEG4 traffic

Mobile ad-hoc networks are characterised by constant topology changes, the absence of fixed infrastructure and lack of any centralised control. Traditional routing algorithms prove to be inefficient in such a changing environment. Ad-hoc routing protocols such as dynamic source routing (DSR), ad-hoc on-demand distance vector routing (AODV) and destination-sequence distance vector (DSDV) have been proposed to solve the multi hop routing problem in ad-hoc networks. Performance studies of these routing protocols have assumed constant bit rate (CBR) traffic. Real-time multimedia traffic generated by video-on demand and teleconferencing services are mostly variable bit rate (VBR) traffic. Most of these multimedia traffic is encoded using the MPEG standard. (ISO moving picture expert group). When video traffic is transferred over MANETs a series of performance issues arise. In this paper we present a performance comparison of three ad-hoc routing protocols - DSR, AODV and DSDV when streaming MPEG4 traffic. Simulation studies show that DSDV performs better than AODV and DSR. However all three protocols fail to provide good performance in large, highly mobile network environments. Further study is required to improve the performance of these protocols in mobile ad-hoc networks offering VBR services.

Secure accounting and payment infrastructure for grid computing

In this paper, we propose an architecture of accounting and payment services for service oriented grid computing systems. The proposed accounting and payment services provide the mechanisms for service providers to be paid for authorized use of their resources. It supports the recording of usage data, secure storage of that data, analysis of that data for purposes of billing and so forth. It allows a variety of payment methods, it is scalable, secure, convenient, and reduce the overall cost of payment processing while taking into account, requirements of Grid computing systems.

A case for cross layer design: the impact of physical layer properties on routing protocol performance in MANETs

In this work we evaluate the performance of routing protocols for mobile ad hoc networks using different physical layer models. The results obtained show that the performance results obtained using idealized models such as the free space propagation model vary significantly when propagation effects such as path loss and shadowing are considered. This difference in performance indicates that optimization is required in the protocol development space that takes into account channel state information (CSI). Such an optimization requires a cross layer approach to be adopted and a framework for protocol performance evaluation to be established. We believe that this work would serve as a first step in this direction. We provide comparative performance results through network simulations.

Identifying dependency between secure messages for protocol analysis

Collusion attack has been recognized as a key issue in e-commerce systems and increasingly attracted people’s attention for quite some time in the literatures of information security. Regardless of the wide application of security protocol, this attack has been largely ignored in the protocol analysis. There is a lack of efficient and intuitive approaches to identify this attack since it is usually hidden and uneasy to find. Thus, this article addresses this critical issue using a compact and intuitive Bayesian network (BN)-based scheme. It assists in not only discovering the secure messages that may lead to the attack but also providing the degree of dependency to measure the occurrence of collusion attack. The experimental results demonstrate that our approaches are useful to detect the collusion attack in secure messages and enhance the protocol analysis.

Geographic routing with cooperative relaying and leapfrogging in wireless sensor networks

A novel geographic routing protocol for multi-hop wireless sensor networks is presented. It exploits the broadcast nature of the wireless channel to enable on-demand cooperative relaying and leapfrogging for circumventing weak radio links. In order to achieve energy efficiency, a metric is introduced for next-hop selection that takes into account information on the residual battery energy, the geographical position of the sensor nodes, and the channel quality of the involved radio links when available. Performance results show that the completely decentralized protocol offers significant benefits by reducing the number of (re)transmissions required to reach the destination. This translates into network-wide energy savings that extend the network lifetime.

Secure mobile agent-based e-negotiation for on-line trading

Electronic negotiation (e-negotiation) is a major activity in e-Commerce applications. Agent-based e-negotiation has recently received increasing attention. However, agent-based electronic negotiation suffers from a number of security attacks. In this paper, we present a mobile agent-based e-commerce framework. We also propose a security protocol that protects the information exchanged between the mobile agents during e- negotiations. We reason the correctness of the proposed security protocol in the presence of various security threats. The reasoning shows that the protocol maintains privacy, non- repudiation, authenticity, anonymity, and strong integrity of exchanged information.