Conferences related to Mobile ad hoc networks

Back to Top

ICC 2021 - IEEE International Conference on Communications

IEEE ICC is one of the two flagship IEEE conferences in the field of communications; Montreal is to host this conference in 2021. Each annual IEEE ICC conference typically attracts approximately 1,500-2,000 attendees, and will present over 1,000 research works over its duration. As well as being an opportunity to share pioneering research ideas and developments, the conference is also an excellent networking and publicity event, giving the opportunity for businesses and clients to link together, and presenting the scope for companies to publicize themselves and their products among the leaders of communications industries from all over the world.


2020 59th IEEE Conference on Decision and Control (CDC)

The CDC is the premier conference dedicated to the advancement of the theory and practice of systems and control. The CDC annually brings together an international community of researchers and practitioners in the field of automatic control to discuss new research results, perspectives on future developments, and innovative applications relevant to decision making, automatic control, and related areas.


2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC)

The 2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC 2020) will be held in Metro Toronto Convention Centre (MTCC), Toronto, Ontario, Canada. SMC 2020 is the flagship conference of the IEEE Systems, Man, and Cybernetics Society. It provides an international forum for researchers and practitioners to report most recent innovations and developments, summarize state-of-the-art, and exchange ideas and advances in all aspects of systems science and engineering, human machine systems, and cybernetics. Advances in these fields have increasing importance in the creation of intelligent environments involving technologies interacting with humans to provide an enriching experience and thereby improve quality of life. Papers related to the conference theme are solicited, including theories, methodologies, and emerging applications. Contributions to theory and practice, including but not limited to the following technical areas, are invited.


GLOBECOM 2020 - 2020 IEEE Global Communications Conference

IEEE Global Communications Conference (GLOBECOM) is one of the IEEE Communications Society’s two flagship conferences dedicated to driving innovation in nearly every aspect of communications. Each year, more than 2,900 scientific researchers and their management submit proposals for program sessions to be held at the annual conference. After extensive peer review, the best of the proposals are selected for the conference program, which includes technical papers, tutorials, workshops and industry sessions designed specifically to advance technologies, systems and infrastructure that are continuing to reshape the world and provide all users with access to an unprecedented spectrum of high-speed, seamless and cost-effective global telecommunications services.


SoutheastCon 2020

SoutheastCon is the annual Region 3 conference that brings together engineering professionals, students, and volunteers for a weekend of technical presentations, meetings, student competitions, and volunteer education.

  • SoutheastCon 2021

    IEEE SoutheastCon is the annual IEEE Region 3 Student, Professional, and awards conference.

  • SoutheastCon 2019

    The annual IEEE SoutheastCon conferences promote all aspects of theories and applications of engineering disciplines. Sponsored by the IEEE Region-3 and IEEE Huntsville Section, this event will attract researchers, professionals, and students from the Southeastern region of the U.S. SoutheastCon 2019 will feature tutorial sessions, workshops, Technical Programs, and student Hardware, Software, Ethics, Paper, Web competitions.

  • SoutheastCon 2018

    SoutheastCon is a annual conference held in Region 3 and covers a Professional Track, Student Track and Regional Track.

  • SoutheastCon 2017

    Broad scope professional paper conference, region 3 annual meeting, region 3 annual student conference

  • SoutheastCon 2016

    Annual Region 3 Trifecta of Student competitions, Technical papers and volunteer training and administration.

  • SoutheastCon 2015

    Horizontal Technical Conference with all topics; students compete in multiple competions; Region 3 training meetings.

  • SOUTHEASTCON 2014

    Horizontal Technical Conference with all topics; students compete in multiple competions; Region 3 training meetings.

  • IEEE SOUTHEASTCON 2013

    Region 3 Meeting, Technical papers, student competitions.

  • SOUTHEASTCON 2012

    The annual IEEE SoutheastCon conferences promote all aspects of the theories and applications of the engineering disciplines. Sponsored by the IEEE Region 03, this event attracts researchers, professionals, and students from the Southeast region of the U.S and beyond. SoutheastCon 2012 will be held in Orlando, Florida.

  • SOUTHEASTCON 2011

    IEEE SoutheastCon2011 is the annual IEEE Region 3 technical, professional, and student conference, invites conference refereed and non-refereed technical paper presentations and tutorials that advance the work and careers of conference attendees in the areas of interest for the conference.

  • SOUTHEASTCON 2010

    SoutheastCon 2010 is the Region 3 event which includes a student conference, a technical conference, and the Region 3 business meeting.

  • SOUTHEASTCON 2009

    It is the annual IEEE Region 3 Technical, Professional, and Student Conference. As the premier conference for the IEEE Region 3, it brings together electrical, computer and other engineering and science professionals, faculty and students to share the latest information through technical sessions, tutorials and exhibits. The conference schedule includes: a technical program with seminars, tutorials, and workshops; exhibits; a student program with student competitions; and IEEE regional meetings.

  • SOUTHEASTCON 2008

    SoutheastCon is the Southeastern USA Region of the IEEE's premier conference. It contains three main sections: a technical program, student competitions and regional meetings. SouthEastCon features technical papers, tutorials and exhibits.

  • SOUTHEASTCON 2007

  • SOUTHEASTCON 2006

  • SOUTHEASTCON 2005

  • SOUTHEASTCON 2004

  • SOUTHEASTCON 2003

  • SOUTHEASTCON 2002

  • SOUTHEASTCON 2001

  • SOUTHEASTCON 2000

  • SOUTHEASTCON '99

  • SOUTHEASTCON '98

  • SOUTHEASTCON '97

  • SOUTHEASTCON '96


More Conferences

Periodicals related to Mobile ad hoc networks

Back to Top

Communications Letters, IEEE

Covers topics in the scope of IEEE Transactions on Communications but in the form of very brief publication (maximum of 6column lengths, including all diagrams and tables.)


Communications Magazine, IEEE

IEEE Communications Magazine was the number three most-cited journal in telecommunications and the number eighteen cited journal in electrical and electronics engineering in 2004, according to the annual Journal Citation Report (2004 edition) published by the Institute for Scientific Information. Read more at http://www.ieee.org/products/citations.html. This magazine covers all areas of communications such as lightwave telecommunications, high-speed data communications, personal communications ...


Communications Surveys & Tutorials, IEEE

Each tutorial reviews currents communications topics in network management and computer and wireless communications. Available tutorials, which are 2.5 to 5 hours in length contains the original visuals and voice-over by the presenter. IEEE Communications Surveys & Tutorials features two distinct types of articles: original articles and reprints. The original articles are exclusively written for IEEE Communications Surveys & Tutorials ...


Communications, IEEE Transactions on

Telephone, telegraphy, facsimile, and point-to-point television, by electromagnetic propagation, including radio; wire; aerial, underground, coaxial, and submarine cables; waveguides, communication satellites, and lasers; in marine, aeronautical, space and fixed station services; repeaters, radio relaying, signal storage, and regeneration; telecommunication error detection and correction; multiplexing and carrier techniques; communication switching systems; data communications; and communication theory. In addition to the above, ...


Computers, IEEE Transactions on

Design and analysis of algorithms, computer systems, and digital networks; methods for specifying, measuring, and modeling the performance of computers and computer systems; design of computer components, such as arithmetic units, data storage devices, and interface devices; design of reliable and testable digital devices and systems; computer networks and distributed computer systems; new computer organizations and architectures; applications of VLSI ...


More Periodicals

Most published Xplore authors for Mobile ad hoc networks

Back to Top

Xplore Articles related to Mobile ad hoc networks

Back to Top

Broadcast with Hitch-hiking in Wireless Ad-Hoc Networks (Invited Talk Abstract)

Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06), 2006

Summary form only given. There have been papers indicating that the maximal ratio combiner device can result in energy savings in wireless ad hoc networks by using hitch-hiking. We study the min-energy broadcast with hitch-hiking problem, an idealized version of broadcast using hitch-hiking, a problem studied experimentally in the INFOCOM 2004 paper of Agarwal et al. min-energy broadcast with hitch-hiking ...


OMAR: Utilizing Multiuser Diversity in Wireless Ad Hoc Networks

IEEE Transactions on Mobile Computing, 2006

One of the most promising approaches to improving communication efficiency in wireless communication systems is the use of multiuser diversity. Although it has been widely investigated and shown feasible and efficient in cellular networks, there is little work for the ad hoc networks, especially in real protocol and algorithm design. In this paper, we propose a novel scheme, namely, the ...


Mobility tolerant maintenance of multi-cast tree in mobile multi-hop radio networks

Proceedings of the 1999 International Conference on Parallel Processing, 1999

When the nodes in a mobile ad hoc network move, existing links often no longer exist and/or new links are created. Any communication protocol designed for such multi-hop ad hoc networks must be able to tolerate such change in network topology that can occur anywhere in the network. Another characteristics of such networks is that bandwidth is a comparatively precious ...


Congestion-aware rate allocation for multipath video streaming over ad hoc wireless networks

2004 International Conference on Image Processing, 2004. ICIP '04., 2004

For multipath video streaming over ad hoc wireless networks, received video quality is influenced by both the encoder performance and the delayed packet arrivals due to limited bandwidth. We propose a rate allocation scheme to optimize the expected received video quality based on simple models of encoder rate-distortion performance and network rate-congestion tradeoffs. Given the embedded bit-streams of a group ...


Routing System in Mobile Ad-Hoc Networks

2006 16th International Crimean Microwave and Telecommunication Technology, 2006

Architecture, functions and decision process of the node routing system MANET have been considered. Ad Hoc networks are considered as the technical evolution from 4G towards private area networks. Mobile ad hoc net works (MANET) consist of wireless nodes that communicate with each other by cooperatively sharing of common wireless medium


More Xplore Articles

Educational Resources on Mobile ad hoc networks

Back to Top

IEEE-USA E-Books

  • Broadcast with Hitch-hiking in Wireless Ad-Hoc Networks (Invited Talk Abstract)

    Summary form only given. There have been papers indicating that the maximal ratio combiner device can result in energy savings in wireless ad hoc networks by using hitch-hiking. We study the min-energy broadcast with hitch-hiking problem, an idealized version of broadcast using hitch-hiking, a problem studied experimentally in the INFOCOM 2004 paper of Agarwal et al. min-energy broadcast with hitch-hiking captures the maximum savings one can achieve in broadcasting using maximal ratio combiners. We show that the optimum of the classical min-energy broadcast problem is at most O(log<sup>2</sup> n) times the optimum of min-energy broadcast with hitch-hiking, where n is the number of nodes in the networks. We show that this bound is tight up to a constant. Moreover, the same bounds hold for Unicast. In the special case when the nodes are on a line and the power requirement for node u to reach node v is d(u, v)<sup>K</sup>, where d(u, v) the Euclidean distance between u and v and k is the signal attenuation exponent, which is assumed to be in between 2 and 5, we show that the optimum of the min-energy broadcast problem is at most a constant times optimum of min-energy broadcast with hitch-hiking. A formal definition of min-energy broadcast with hitch-hiking is given below. The input consists of a complete directed graph G = (V, E) with power requirement function c : E rarr R<sup>+ </sup>, and a source s epsi V. The output consists of a permutation tau =&lt; v<sub>1</sub>, v<sub>2</sub>, ..., v <sub>n</sub> &gt; of V with v<sub>n</sub> = s and power assignment p(v) of every vertex v. For every 1 les i les i &lt; j les n, define q(v<sub>i</sub>, v<sub>j </sub>) = p(v<sub>i</sub>)/c(v<sub>i</sub>)<sub>j</sub>). An output is feasible if for every j &gt; 1 we have Sigma<sub>i = 1</sub> <sup>j - 1 </sup> q(v<sub>i</sub>v<sub>j</sub>) ges 1. The objective is to minimize Sigma<sub>i = 1</sub> <sup>n</sup> p(v<sub>i</sub>)

  • OMAR: Utilizing Multiuser Diversity in Wireless Ad Hoc Networks

    One of the most promising approaches to improving communication efficiency in wireless communication systems is the use of multiuser diversity. Although it has been widely investigated and shown feasible and efficient in cellular networks, there is little work for the ad hoc networks, especially in real protocol and algorithm design. In this paper, we propose a novel scheme, namely, the opportunistic medium access and auto rate (OMAR), to efficiently utilize the shared medium in IEEE 802.11-based ad hoc networks by taking advantage of diversity, distributed scheduling, and adaptivity. In an ad hoc network, especially in a heterogeneous ad hoc network or a mesh network, some nodes may need to communicate with multiple one-hop nodes. We allow such a node with a certain number of links to function as a clusterhead to locally coordinate multiuser communications. We introduce a CDF-based (cumulative distribution function) K-ary opportunistic splitting algorithm and a distributed stochastic scheduling algorithm to resolve intra and intercluster collisions, respectively. Fairness is formulated and solved in terms of social optimality within and across clusters. Analytical and simulation results show that our scheme can significantly improve communication efficiency while providing social fairness

  • Mobility tolerant maintenance of multi-cast tree in mobile multi-hop radio networks

    When the nodes in a mobile ad hoc network move, existing links often no longer exist and/or new links are created. Any communication protocol designed for such multi-hop ad hoc networks must be able to tolerate such change in network topology that can occur anywhere in the network. Another characteristics of such networks is that bandwidth is a comparatively precious resource and needs to be conserved. Our purpose in the present paper is to explore the possibilities of applying the relatively new paradigm of self-stabilization in distributed fault tolerant algorithm design to tackle the problem of topology change in mobile networks. Self-stabilizing distributed algorithms converge to a global legitimate state in presence of any number of intermittent faults and still use only local knowledge for actions at each node. Our objective is to view the topology change as a change in the node adjacency information at one or more nodes and utilize the tools of self-stabilization to converge to a stable global state in the new network graph. We illustrate the concept by designing a new efficient distributed algorithm for multi-cast in a mobile network that can accommodate any change in the network topology due to node mobility.

  • Congestion-aware rate allocation for multipath video streaming over ad hoc wireless networks

    For multipath video streaming over ad hoc wireless networks, received video quality is influenced by both the encoder performance and the delayed packet arrivals due to limited bandwidth. We propose a rate allocation scheme to optimize the expected received video quality based on simple models of encoder rate-distortion performance and network rate-congestion tradeoffs. Given the embedded bit-streams of a group of video frames and the cross traffic condition on a given set of paths, a gradient descent method is used to determine the amount of bits to be transmitted over the multiple paths for each frame. Two rate allocation strategies, layered representation and partial repetition are also investigated. Simulation results of video streaming over a 15-node wireless ad hoc network demonstrates the benefit of performing rate allocation optimization over a simple heuristic scheme. It is also shown that while layered representation is more efficient for mild delay constraints, partial repetition is more robust against packet losses.

  • Routing System in Mobile Ad-Hoc Networks

    Architecture, functions and decision process of the node routing system MANET have been considered. Ad Hoc networks are considered as the technical evolution from 4G towards private area networks. Mobile ad hoc net works (MANET) consist of wireless nodes that communicate with each other by cooperatively sharing of common wireless medium

  • A novel routing algorithm for ad hoc networks

    A mobile ad hoc network (MANET) is comprised of mobile hosts that can communicate with two other using wireless links. In this paper we present a novel routing algorithm called GPSAL (GPS/ant-like routing algorithm) which is based on GPS (Global Positioning System) and mobile software agents modeled on ants for routing in ad hoc networks. We compare our algorithm to the location- aided routing (LAR) algorithm for MANET which is also based on GPS. Simulation results show that our algorithm has less overhead than LAR.

  • Secure distributed routing in ad hoc networks

    In mobile ad hoc networks, nodes do not rely on any routing infrastructure but the nodes route messages for each other. This communication set up functions properly only when the participating nodes cooperate with each other in routing and forwarding. It may, however, be advantageous for some nodes not to cooperate (e.g, to save power or get more bandwidth or to launch security attacks). This paper describes a security solution for an ad hoc network routing protocol in the context of associativity based routing (ABR) protocol.

  • Simulation Performance Evaluation of an Energy Efficient Routing Protocol for Mobile Ad Hoc Networks

    Energy conservation is one of the most important issues in ad hoc networks, where computers used are usually supplied with limited autonomous resources. Recent studies show that the energy consumed for routing data-packets in wireless ad hoc networks can be significantly reduced compared with the current min-hop max-power routing protocols. But designing a power efficient routing protocol is one of the most challenging issues. In this work, we have conducted a detailed simulation to evaluate the performance of our energy efficient routing protocol [An energy efficient routing protocol for mobile ad hoc network] derived from DSR, in this simulation we have compared our protocol with the standard DSR considered as benchmark.

  • A K-hop Based Clustering Algorithm in Ad Hoc Networks

    In this paper, an improved k-hop cluster based algorithm in mobile ad-hoc networks (MANET) is proposed and its performance is analyzed. Experimental results show that the proposed clustering algorithm outperforms an existing algorithm.

  • Nash equilibria of packet forwarding strategies in wireless ad hoc networks

    In self-organizing ad hoc networks, all the networking functions rely on the contribution of the participants. As a basic example, nodes have to forward packets for each other in order to enable multihop communication. In recent years, incentive mechanisms have been proposed to give nodes incentive to cooperate, especially in packet forwarding. However, the need for these mechanisms was not formally justified. In this paper, we address the problem of whether cooperation can exist without incentive mechanisms. We propose a model,based on game theory and graph theory to investigate equilibrium conditions of packet forwarding strategies. We prove theorems about the equilibrium conditions for both cooperative and noncooperative strategies. We perform simulations to estimate the probability that the conditions for a cooperative equilibrium hold in randomly generated network scenarios.. As the problem is involved, we deliberately restrict ourselves to a static configuration. We conclude that in static ad hoc networks where the relationships between the nodes are likely to be stab le-cooperation needs to be encouraged.



Standards related to Mobile ad hoc networks

Back to Top

No standards are currently tagged "Mobile ad hoc networks"


Jobs related to Mobile ad hoc networks

Back to Top