A Trustworthy and well-organized data disseminating scheme for ad-hoc wsns

Imran, Nomica; Khan, Salman; Rao, Imran

doi:10.5121/ijcnc.2010.2313

Cited by 4 publications

(6 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For all cases (6x6 ,7x7, 8x8, 9x9 and 10x10), we use Єamp = 100 pJ/bit/m2, ERX_elec = 50 nJ/bit, ETX_elec = 50 nJ/bit as in [8,12] for calculating the power consumption represented by (1) and (2). Also we assume the source node and the destination node are the two farthest nodes in the grid that sends and receives data along the diagonal path.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Different Node Deployments in a Square Area Grid of Wireless Sensor Network and Optimal Number of Relays

Nasser¹

2012

IJCNC

View full text Add to dashboard Cite

Wireless sensor networks deployment is an important issue to be considered when trying to cover an area with sensors, our work focuses on the deployment of a grid network for larger number of sensor nodes from 36 nodes up to 100 nodes. We study different cases of distances between source an destination, the result showed the diagonal path is the best path where least energy consumption are consumed. The diagonal path use number of intermediate nodes (relays) along it. Our result show the best number of relay nodes and different distances between source node and destination node according to some threshold distances.

show abstract

Section: Resultsmentioning

confidence: 99%

“…A wireless sensor network is a collection of sensor nodes which are consist of sensing unit, processing unit, transceiver unit, and power unit [1]. The sensor nodes collect the data from its environment and send the collected data to the single hop neighboring nodes which in turn send this data to the sink node [2].…”

Section: Introductionmentioning

confidence: 99%

Different Node Deployments in a Square Area Grid of Wireless Sensor Network and Optimal Number of Relays

Nasser¹

2012

IJCNC

View full text Add to dashboard Cite

show abstract

“…This paper calculates the expected run time of the designed random algorithm. Imran, N. et al [15] propose a gossip based protocol that consumes little resources. Our proposed scheme aims to keep the routing table size R as low as possible yet it ensures that the diameter is small too.…”

Section: Related Workmentioning

confidence: 99%

“…The malicious nodes need to be geographically separated in order for the attack to be effective. In this attack, a malicious node captures packets from one location and "tunnels" these packets to the other malicious node, which is assumed to be located at some distance [8] [15]. The second malicious node is then expected to replay the "tunneled" packets locally.…”

Section: Figure 1: Classification Of Attack In Manetmentioning

confidence: 99%

Grilling Gratuitous Detour in ADHOC Network

Vijayalakshmi¹,

Rabara²

2011

IJDPS

View full text Add to dashboard Cite

Routing is a critical function in adhoc network which claim special attention and support extended by the trustable neighbor nodes. The peril of Gratuitous detour on routing process in ad hoc network is manifold which culminates in the deterioration of network performance amounting to deplorable network behavior. Routing in ad hoc network is a cooperative process as it requires periodic assistance from the intermediate nodes to route the packets to the far off nodes that are beyond the direct wireless transmission range. The role of intermediate nodes in routing is crucial and it mandates special attention and support from the sender node and as well the good Samaritan neighboring nodes. This paper advocates the creation of two lists namely PFL and SFL backed by Dominant Pruning Method. The misbehaving middle node exhibiting Gratuitous Detour (GD) has to be curtailed by performing a cardinality operation on the route cache (storing the intermediate nodes enroute to the destination) of the nodes in PFL and SFL. The sender node stringent process of recruiting the genuine intermediate nodes in both the list is echoed periodically by performing a cardinal operation to restrain the occurrence of GD which manifest by projecting a non existent node or concealing an existent node. The result of the cardinal operation approves the truth that the nodes in Route cache (Buffered Route Path) are genuine or not. The proposed solution demands a heavy pay from the M 3 N whose intention is either to disrupt the optimal routing process by hiding a potential peer after launching a blackmail or DoS attack on it. The ulterior motive of the Malicious Misbehaving Middle (M 3 N) in projecting the non existent nodes (Longer Virtual Route) to evade the role of routing intermediary is also effectively thwarted. Suitable graph have been simulated to study the effect of mobility and no. of misbehaving nodes on the Sender Node Probing Latency Index (SNPLI).

show abstract

“…Many techniques are used in data dissemination [11], [13] and cluster head election [5], [18], [16]. Fountain codes and random walks have been used to disseminate data from κ sources to a set of storage nodes τ , see [12], [14].…”

Section: Introductionmentioning

confidence: 99%

Data Dissemination and Collection Algorithms for Collaborative Sensor Devices Using Dynamic Cluster Heads

Aly¹,

Salim²

2013

Trends in Applied Sciences Research

View full text Add to dashboard Cite

We develop novel data dissemination and collection algorithms for Wireless Sensor Networks (WSNs) in which we consider n sensor nodes distributed randomly in a certain field to measure a physical phenomena. Such sensors have limited energy, shortage coverage range, bandwidth and memory constraints. We desire to disseminate nodes' data throughout the network such that a base station will be able to collect the sensed data by querying a small number of nodes. We propose two data dissemination and collection algorithms (DCA's) to solve this problem. Data dissemination is achieved through dynamical selection of some nodes. The selected nodes will be changed after a time slot t and may be repeated after a period T . 1

show abstract

A Trustworthy and well-organized data disseminating scheme for ad-hoc wsns

Abstract: ABSTRACT

Cited by 4 publications

References 14 publications

Different Node Deployments in a Square Area Grid of Wireless Sensor Network and Optimal Number of Relays

Different Node Deployments in a Square Area Grid of Wireless Sensor Network and Optimal Number of Relays

Grilling Gratuitous Detour in ADHOC Network

Data Dissemination and Collection Algorithms for Collaborative Sensor Devices Using Dynamic Cluster Heads

Contact Info

Product

Resources

About