We propose a complete design for a scope limited, multihop broadcast middleware, which is adapted to the variability of the ad-hoc environment and works in unlimited ad-hoc networks such as a crowd in a city, or car passengers in a busy highway system. We address practical problems posed by: the impossibility to set the TTL correctly at all times, the poor performance of multiple access protoco...

In social based mobility network comprises of selfish individuals that are not willing to forward the packets but wants to forward their own messages. Proposed system uses a context based protocol that can be used in social aware network like PSN. Here suggests a method to effectively detect selfish nodes from the network. It helps to differentiate selfish nodes from broken and overloaded nodes...

Location management is important to effectively keep track of mobile terminals with reduced signal flows and database queries. A system with single home location register and pointer forwarding is assumed. A mobile terminal is assumed to have memory to store the IDs of visitor location registers (VLRs) each of which has the forwarding pointer to identify its current location. To obtain the regi...

In order to extend the application scope of NDN and realize transmission different NDNs across IP networks, a method for interconnecting networks distributed in areas with is proposed. Firstly, data resource located by means DNS mechanism, gateway address network where found. Then, between implemented based on tunnel technology. addition, achieve efficient fast forwarding, we have added small n...

We consider the problem of energy-efficient broadcasting on large ad-hoc networks. Ad-hoc networks are generally modelled using random geometric graphs (RGGs). Here, nodes deployed uniformly in a square area around origin, and any two which within Euclidean distance 1 assumed to be able receive each other’s broadcast. A source node at origin encodes k data packets information into n(>k) coded t...

With the advances in wireless communication, spontaneously creating impromptu networks, self-organizing and adapting to changing conditions are becoming a reality. Due to the spontaneous nature of such self-organizing networks (SONs), dealing with communication outages needs to be inherent in the network design. For instance, research on delay-tolerant networks tries to address this issue for t...

Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) flooding approaches that are used to disseminate globally information in unstructured peer-to-peer and other networks. A key challenge in using probabilistic flooding is the determination of the forwarding probability s...

Autonomic and opportunistic communications require specific routing algorithms, like replication-based algorithms or context-based forwarding. In addition to confidentiality, privacy is a major concern for protocols which disseminate the context of their destination. In this paper, we focus on the confidentiality and privacy issue inherent to context-based protocols, in the framework of an orig...

This paper presents a novel routing protocol for Disruption Tolerant Networks (DTNs) called Efficient DTN Routing Protocol (EDRP). EDRP smartly integrates the forwarding and buffer management policies into an adaptive protocol that includes a local network parameters estimation mechanism. It dynamically adjusts the delivery probability for messages according to a new metric. Meanwhile, EDRP arr...

Multicasting protocols can be used to improve the efficiency of the wireless links in Mobile Ad hoc Networks when sending multiple copies of messages from multiple sources to multiple receivers. In this paper, a Source initiated Mesh based QoS Probabilistic multicast routing protocol (SQMP) for MANETs is proposed. SQMP is inspired from the ant colony’s route finding algorithm in which an ant ch...