Results 281 to 290 of about 248,355 (346)

A survey on intrusion detection and prevention in wireless ad-hoc networks

Journal of systems architecture, 2020
Ad hoc networks have been serving us in one way or the other, for two decades, through their vast variety of applications in majority fields. Due to their features such as hostile deployments, high level of mobility, limited resources and physical ...
K. Khan, A. Mehmood, Shafiullah Khan, Muhammad Altaf Khan, Z. Iqbal, W. K. Mashwani   +5 more
semanticscholar   +1 more source

Growth of wireless ad hoc networks

GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489), 2004
The utility of a node in an energy-limited wireless ad hoc network is defined as a positive linear function of the number of bits that the node sends as a source and the number of bits that it receives as a destination. First, we show that under the one-to-one traffic model in which every node wants to send traffic to a randomly chosen destination node,
Volkan Rodoplu, Teresa H. Meng
openaire   +1 more source

Routing in wireless ad hoc networks

International Journal of Internet Protocol Technology, 2012
A routing strategy that finds a path to be followed by packets from a source node to a destination node used in traditional wired networks cannot be directly applied in ad hoc wireless networks due to their highly dynamic topology, absence of established infrastructure for centralised administration, bandwidth constrained wireless links, and energy ...
Vinay Rishiwal, Mano Yadav
openaire   +1 more source

Flooding in wireless ad hoc networks

Computer Communications, 2001
In an ad hoc network, each host assumes the role of a router and relays packets toward final destinations. This paper studies efficient routing mechanisms for packet flooding in ad hoc wireless networks. Because a packet is broadcast to all neighboring nodes, the optimality criteria of wireless network routing are different from that of the wired ...
Hyojun Lim, Chongkwon Kim
openaire   +1 more source

On network coding in wireless ad-hoc networks

International Journal of Ad Hoc and Ubiquitous Computing, 2005
Network coding has been proven to be an effective way to achieve the maximum flow capacity in a multicast network, which is bounded by the famous maximum-flow minimum-cut theorem. This technique is specially fit for some new types of network, e.g., ad-hoc, sensor network etc.
Jingyao Zhang, Pingyi Fan
openaire   +1 more source

Priority Scheduling in Wireless Ad Hoc Networks

Wireless Networks, 2002
Ad hoc networks formed without the aid of any established infrastructure are typically multi-hop networks. Location dependent contention and hidden terminal problem make priority scheduling in multi-hop networks significantly different from that in wireless LANs.
Xue Yang 0007, Nitin H. Vaidya
openaire   +1 more source

Wireless ad hoc nanoscale networking

IEEE Wireless Communications, 2009
Wireless ad hoc communication on the nanoscale will require thinking outside of the traditional radio spectrum. New applications will utilize new forms of wireless communication channels. For example, nanoscale communication will enable precise mechanisms for directly interacting with cells in vivo.
openaire   +1 more source

Coverage in wireless ad-hoc sensor networks

2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333), 2003
Sensor networks pose a number of challenging conceptual and optimization problems such as location, deployment, and tracking. One of the fundamental problems in sensor networks is the calculation of the coverage. In Meguerdichian et al. (2001), it is assumed that the sensor has uniform sensing ability.
Xiang-Yang Li 0001, Peng-Jun Wan, Ophir Frieder   +2 more
openaire   +1 more source

Wireless Agents in Ad Hoc Networks

2003
With the current trend toward ubiquitous computing comes wireless devices capable of direct, peer-to-peer communication. Such devices will be capable of forming the nodes of ad hoc networks. In the near future, it is expected that ad hoc networks will be saturated with heterogeneous hardware and software requiring mechanisms to facilitate ...
Stephen Quirolgico, L. Jay Wantz, Michael Miller, Naveen Srinivasan, Vlad Korolev, Michael Fay   +5 more
openaire   +1 more source

Information-Theoretic Upper Bounds on the Capacity of Large Extended Ad Hoc Wireless Networks

IEEE Transactions on Information Theory, 2005
Olivier Lévêque
exaly   +3 more sources