Localized LMST and RNG based minimum-energy broadcast protocols in ad hoc networks

Cartigny, Julien; Ingelrest, François; Simplot‐Ryl, David; Stojmenović, Ivan

doi:10.1016/j.adhoc.2003.09.005

Cited by 92 publications

(59 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…[2] gives the concept of the scheme is inspired by geographic routing and face routing in particular. brink detection algorithm, optimal sensor selection algorithm.…”

Section: Related Workmentioning

confidence: 99%

Detection of Hacking nodes using Dynamic Sensor with Ant Colony Optimization

R.Balaji¹

2015

IJIRCCE

View full text Add to dashboard Cite

Detection of hacking nodes can be defined as tracking system to show the negative effects that malicious nodes cause in MANET (Mobile ad hoc network. This paper proposes an survey about Detection of hacking nodes based on data transmission. The main problem in existing system is that the variable brink length of the polygon and the impact of the targets dynamic movements, brink detection and real time polygon. After the survey on various literature papers, we are concluding a new way, that increases confidentiality of the data and efficiency, , we have enclosed the proposed method with the ACO algorithm which allow itself to detect the terrorist nodes that are to be labeled and performs the active classification,. A mobile ad hoc network (MANET) is a group of mobile hosts and able to communicate one another in the absence of fixed infrastructure.. If the entity at a particular range cannot be determined then several static nodes are located for better coverage and to reduce the total travelled distance by the nodes. The approximation and the foreseeing of the nodes are done by space Theory and the location of the nodes by using ant colony optimization..

show abstract

“…[2] gives the concept of the scheme is inspired by geographic routing and face routing in particular. brink detection algorithm, optimal sensor selection algorithm.…”

Section: Related Workmentioning

confidence: 99%

Detection of Hacking nodes using Dynamic Sensor with Ant Colony Optimization

R.Balaji¹

2015

IJIRCCE

View full text Add to dashboard Cite

show abstract

“…They argued for the existence of optimal radius computed with hexagonal tiling of network area, that minimizes the energy consumption for a broadcast operation. The authors modified the existing LBOP [6] to take advantage of the optimal radius. This new protocol is named as Target In Target Radius and Dominating Set Based Protocol (TRDS) [20], the radii of nodes are reduced to the target transmission radius T .…”

Section: Rn G(g)mentioning

confidence: 99%

Minimum energy broadcast in duty cycled wireless sensor networks

Jahan

Narayanan

2013

2013 IEEE Wireless Communications and Networking Conference (WCNC)

View full text Add to dashboard Cite

Minimum Energy Broadcast in Duty Cycled Wireless Sensor NetworksMosarrat JahanWe study the problem of finding a minimum energy broadcast tree in duty cycled wireless sensor networks. In such networks, every node has a wakeup schedule and is awake and ready to receive packets or transmit in certain time slots during the schedule and asleep during the rest of the schedule. We assume that a forwarding node needs to stay awake to forward a packet to the next hop neighbor until the neighbor is awake. The minimum energy broadcast tree minimizes the number of additional time units that nodes have to stay awake in order to accomplish broadcast. We show that finding the minimum energy broadcast tree is NP-hard. We give two algorithms for finding energy-efficient broadcast trees in such networks. We performed extensive simulations to study the performance of these algorithms and compare them with previously proposed algorithms. Our results show that our algorithms exhibit the best performance in terms of average number of additional time units a node needs to be awake, as well as in terms of the smallest number of highly loaded nodes, while being competitive with previous algorithms in terms of the total number of transmissions and delay.iii

show abstract

“…In every triangle, the link with the greatest weight is removed. RNG is widely used and on most of utilizations the weight considered is the distance [1,12]. So, the longest edge in each triangle is removed.…”

Section: Related Workmentioning

confidence: 99%

Using Battery Level as Metric for Graph Planarization

Radak

Mitton

Simplot‐Ryl

2011

Ad-Hoc, Mobile, and Wireless Networks

Self Cite

View full text Add to dashboard Cite

Abstract. Topology control in wireless sensor networks is an important issue for scalability and energy efficiency. It is often based on graph reduction performed through the use of Gabriel Graph or Relative Neighborhood Graph. This graph reduction is usually based on geometric values. In this paper we tackle the problem of possible connectivity loss in the reduced graph by applying a battery level based reduction graph. Experiments are conducted to evaluate our proposition. Results are compared with RNG reduction which takes into account only the strength of the received signal (RSSI). Results show that our algorithm maintains network connectivity longer than solutions from the literature and balances the energy consumption over nodes.

show abstract

Localized LMST and RNG based minimum-energy broadcast protocols in ad hoc networks

Cited by 92 publications

References 20 publications

Detection of Hacking nodes using Dynamic Sensor with Ant Colony Optimization

Detection of Hacking nodes using Dynamic Sensor with Ant Colony Optimization

Minimum energy broadcast in duty cycled wireless sensor networks

Using Battery Level as Metric for Graph Planarization

Contact Info

Product

Resources

About