Wireless Communications

What will 5G be? What it will not be is an incremental advance on 4G. The previous four generations of cellular technology have each been a major paradigm shift that has broken backward compatibility. Indeed, 5G will need to be a paradigm shift that includes very high carrier frequencies with massive bandwidths, extreme base station and device densities, and unprecedented numbers of antennas. However, unlike the previous four generations, it will also be highly integrative: tying any new 5G air interface and spectrum together with LTE and WiFi to provide universal high-rate coverage and a seamless user experience. To support this, the core network will also have to reach unprecedented levels of flexibility and intelligence, spectrum regulation will need to be rethought and improved, and energy and cost efficiencies will become even more critical considerations. This paper discusses all of these topics, identifying key challenges for future research and preliminary 5G standardization activities, while providing a comprehensive overview of the current literature, and in particular of the papers appearing in this special issue.

What Will 5G Be

An ad hoc networkis a collwtion of wirelessmobilenodes dynamically forminga temporarynetworkwithouttheuseof anyexistingnetworkirrfrastructureor centralizedadministration.Dueto the limitedtransmissionrange of ~vlrelessnenvorkinterfaces,multiplenetwork“hops”maybe neededfor onenodeto exchangedata ivithanotheracrox thenetwork.Inrecentyears, a ttiery of nelvroutingprotocols~geted specificallyat this environment havebeen developed.but little pcrfomrartwinformationon mch protocol and no ralistic performancecomparisonbehvwrrthem ISavailable. ~Is paper presentsthe results of a derailedpacket-levelsimulationcomparing fourmulti-hopwirelessad hoc networkroutingprotocolsthatcovera range of designchoices: DSDV,TORA, DSR and AODV. \Vehave extended the /~r-2networksimulatorto accuratelymodelthe MACandphysical-layer behaviorof the IEEE 802.1I wirelessLANstandard,includinga realistic wtrelesstransmissionchannelmodel, and present the resultsof simulations of net(vorksof 50 mobilenodes.

/pdf/a-performance-comparison-of-multi-hop-wireless-ad-hoc-367m37i8yu.pdf

A performance comparison of multi-hop wireless ad hoc network routing protocols

This paper describes two techniques that improve throughput in an ad hoc network in the presence of nodes that agree to forward packets but fail to do so. To mitigate this problem, we propose categorizing nodes based upon their dynamically measured behavior. We use a watchdog that identifies misbehaving nodes and a pathrater that helps routing protocols avoid these nodes. Through simulation we evaluate watchdog and pathrater using packet throughput, percentage of overhead (routing) transmissions, and the accuracy of misbehaving node detection. When used together in a network with moderate mobility, the two techniques increase throughput by 17% in the presence of 40% misbehaving nodes, while increasing the percentage of overhead transmissions from the standard routing protocol's 9% to 17%. During extreme mobility, watchdog and pathrater can increase network throughput by 27%, while increasing the overhead transmissions from the standard routing protocol's 12% to 24%.

/pdf/mitigating-routing-misbehavior-in-mobile-ad-hoc-networks-3fdj9bxaq3.pdf

Mitigating routing misbehavior in mobile ad hoc networks

We introduce a geographical adaptive fidelity (GAF) algorithm that reduces energy consumption in ad hoc wireless networks. GAF conserves energy by identifying nodes that are equivalent from a routing perspective and turning off unnecessary nodes, keeping a constant level of routing fidelity. GAF moderates this policy using application- and system-level information; nodes that source or sink data remain on and intermediate nodes monitor and balance energy use. GAF is independent of the underlying ad hoc routing protocol; we simulate GAF over unmodified AODV and DSR. Analysis and simulation studies of GAF show that it can consume 40% to 60% less energy than an unmodified ad hoc routing protocol. Moreover, simulations of GAF suggest that network lifetime increases proportionally to node density; in one example, a four-fold increase in node density leads to network lifetime increase for 3 to 6 times (depending on the mobility pattern). More generally, GAF is an example of adaptive fidelity, a technique proposed for extending the lifetime of self-configuring systems by exploiting redundancy to conserve energy while maintaining application fidelity.

Geography-informed Energy Conservation for Ad Hoc Routing

Temporally-Ordered Routing Algorithm (TORA) Version 1 Functional Specification

Aura-net is a mobile communications system whose function realizes a new form of proximityaware networking, and whose form points in the direction of a "Proximity-aware Internetwork." The system is founded on an implementation of a "wireless sense." The existence of such a sense, it is argued, is essential for realization of a vision of Ubiquitous Computing famously expounded by Mark Weiser [1]. Moreover, current wireless technologies are ill-suited to enabling this vision. The proposed wireless technology (FlashLinQ) is described at a conceptual and tutorial level.

Toward proximity-aware internetworking

A mobile communications system that uses IP packets to transmit data between end nodes, such as mobile devices, is described. In order to facilitate session establishment, maintenance, security, and handoff operations, access nodes through which end nodes communicate with one another include a session signaling server module and a mobility agent module. The session signaling server module may be implemented as a SIP server while the mobility agent module may be implemented using Mobil IP signaling. The mobility agent and SIP server within an access node are identified using a single shared identifier, IP address. The same security method and common secret may be used to provide security with regard to both mobile IP messages and SIP messages. Sessions admission decisions and resource allocation for admitted sessions can also take place internally to the access node of this invention without need for signaling to external elements.

Methods and apparatus for supporting session signaling and mobility management in a communications system

Group communications methods and apparatus are described. In particular, methods for granting a mobile device access to a communications resource, e.g., the right to transmit data, associated with a group are described. User requests for the communications resource are suppressed by the corresponding mobile device, for periods during which the communications resource has been granted to another mobile device. A mobile device may store a suppressed user request so that a resource request signal may be transmitted after the communications resource has been released by the mobile device that was previously granted the resource. In this manner requests that cannot be granted are not transmitted, increasing communications efficiency as compared to systems where requests are not suppressed at the mobile devices. A priority scheme is used in some embodiments to determine whether or not a request should be suppressed while another device has been granted the communications resource.

Methods and apparatus for supporting group communications

Providing for secure tracking and reporting of wireless resources utilized by a mobile device is described herein. By way of example, resources utilized in conjunction with network-facilitated or peer-to-peer wireless data exchange can be tracked in secure, tamper-resistant components of the mobile device. Further, a report can be compiled from the tracked information and digitally signed with a secret data/material specific to the mobile device. The signed report can be submitted to a network server in conjunction with accounting, billing or like functions. By validating the signature of a mobile device, the network server can trust that information collected and submitted by user devices has not been tampered with or spoofed with an ID of another such device.

Vincent D. Park

Papers

Temporally-Ordered Routing Algorithm (TORA) Version 1 Functional Specification

Toward proximity-aware internetworking

Methods and apparatus for supporting session signaling and mobility management in a communications system

Methods and apparatus for supporting group communications

Certified device-based accounting