BOSS: Beacon-less On Demand Strategy for Geographic Routing inWireless Sensor Networks

Sánchez, Juan A.; Marin-Perez, Rafael; Ruíz, Pedro Ortega

doi:10.1109/mobhoc.2007.4428612

Cited by 67 publications

(50 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To select the best forwarder among the candidate list, a priority timer-based forwarder is chosen among the potential candidates to forward the packets and uses adaptive forwarding path selection to minimize duplicate transmissions [29]. A new timer-based contention scheme: Discrete Dynamic Forwarding Delay (DDFD) is used to refrain from periodic transmission of the beacon message, reduce duplication and collision while selecting a forwarding node [30]. Michele and Rao [28] have used optimum number of hops and average number of neighbour nodes as a metric to select the forwarding nodes.…”

Section: Related Workmentioning

confidence: 99%

LR3: Link Reliable Reactive Routing Protocol for Wireless Sensor Networks

S.R¹,

S.²,

M.³

2017

IJCA

View full text Add to dashboard Cite

Existing reliable-oriented routing protocols computes link reliability based on the packet reception ratio and neglects impact of various parameters such as noise, shadowing, battery-lifespan, uncertainty and geographic locations. In this paper, we propose a Link Reliable Reactive Routing (LR 3 ) protocol for WSNs to accomplish reliable and resilience to out-of-order transmission and path diversity at each hop. The log-normal shadowing model is used to estimate link reliability and a back-off scheme is used to determine delay. A new cost estimated to find forwarding nodes on mentor path that includes link reliability, delay, status of queue at forwarding node and packet advancement at the forwarding node. LR 3 is simulated using NS-2 and results show that it outperforms other reactive routing protocols in terms of packet delivery ratio, latency, link reliability and data transmission cost [1] [2].

show abstract

Section: Related Workmentioning

confidence: 99%

LR3: Link Reliable Reactive Routing Protocol for Wireless Sensor Networks

S.R¹,

S.²,

M.³

2017

IJCA

View full text Add to dashboard Cite

show abstract

“…• Distance from the sink to the node willing to participate in the contention process must be less than that to the source node, and can be determined as in [14]. This makes the path as short as possible and prevents looping.…”

Section: B Algorithm Descriptionmentioning

confidence: 99%

Dynamic Aggregation Protocol for Wireless Sensor Networks

Said

Ibrahim

Soua

et al. 2013

2013 IEEE 27th International Conference on Advanced Information Networking and Applications (AINA)

View full text Add to dashboard Cite

Abstract-Sensor networks suffer from limited capabilities such as bandwidth, low processing power, and memory size. There is therefore a need for protocols that deliver sensor data in an energy-efficient way to the sink. One of those techniques, it gathers sensors' data in a small size packet suitable for transmission.In this paper, we propose a new Effective Data Aggregation Protocol (DAP) to reduce the energy consumption in Wireless Sensor Networks (WSNs), which prolongs the network lifetime. This work uses in-network aggregation approach to distribute the processing all over the aggregation path to avoid unbalanced power consumption on specific nodes until they run out.Simulation results prove that DAP, compared to other protocols, achieves more data aggregation percentage and less power consumption for a one data harvesting round.

show abstract

“…Disaster management operations and battalion of soldiers are the example of applications of such cooperative ad-hoc wireless networks. This paper propose a protocol CoopGeo [1] [4], based on position location of nodes obtained using GPS technology [7].…”

Section: Related Workmentioning

confidence: 99%

“…Existing BLGR protocol called BOSS protocol, uses a three-way handshake [7] (DATA/RESPONSE/SELECTION) and an area-based timer-assignment function to reduce collisions among responses during the forwarder selection phase. Geographic Routing (GR) algorithms require nodes to periodically transmit HELLO messages to allow neighbours know their positions (beaconing mechanism) [9].…”

Section: Related Workmentioning

confidence: 99%

Error Performance Analysis Using Cooperative Contention-Based Routing in Wireless Adhoc Networks

Srimathy¹

2012

IJCSEIT

View full text Add to dashboard Cite

In Wireless Ad hoc network, cooperation of nodes can be achieved by more interactions at higher protocol layers, particularly the MAC (Medium Access Control) and network layers play vital role. MAC facilitates a routing protocol based on position location of nodes at network layer specially known as Beacon-less geographic routing (BLGR) using Contention-based selection process. This paper proposes two levels of cross-layer framework -a MAC network cross-layer design for forwarder selection (or routing) and a MAC-PHY for relay selection. Wireless networks suffers huge number of communication at the same time leads to increase in collision and energy consumption; hence focused on new Contention access method that uses a dynamical change of channel access probability which can reduce the number of contention times and collisions. Simulation result demonstrates the best

show abstract

BOSS: Beacon-less On Demand Strategy for Geographic Routing inWireless Sensor Networks

Cited by 67 publications

References 14 publications

LR3: Link Reliable Reactive Routing Protocol for Wireless Sensor Networks

LR3: Link Reliable Reactive Routing Protocol for Wireless Sensor Networks

Dynamic Aggregation Protocol for Wireless Sensor Networks

Error Performance Analysis Using Cooperative Contention-Based Routing in Wireless Adhoc Networks

Contact Info

Product

Resources

About