搜索结果: 1-6 共查到“通信网络技术 wireless networks”相关记录6条 . 查询时间(0.219 秒)
Living in the ‘90s?So are underwater wireless networks
Living the 90s underwater wireless networks
2016/1/25
Like Beanie Babies and Steve Urkel, the systems we use to transmit information through water bring to mind the 1990s.Related Assets:The flashback is due to the speed of today’s underwater communicatio...
Optimizing adaptive modulation in wireless networks via utility maximization
Adaptive modulation network power physical layer electric power the interest rate
2015/8/10
We investigate adaptive modulation using the network utility maximization framework. We derive new crosslayer optimal power and rate adaptation policies for several practical modulation schemes. The b...
A Distributed Algorithm for Maximum Lifetime Routing in Ad Hoc Wireless Networks
Wireless Networks Maximum Lifetime Routing
2015/6/19
An ad hoc sensor network of nodes with wireless transceiver capabilities is considered. We propose distributed algorithms to compute an optimal routing scheme that maximizes the time at which the firs...
An O(log n) Distributed Approximation Algorithm for Local Broadcasting in Unstructured Wireless Networks
Local Broadcasting Unstructured Wireless Networks
2012/6/13
The unstructured multi-hop radio network model, with asynchronous wake-up, no collision detection and little knowledge on the network topology, is proposed for capturing the particularly harsh charact...
Energy Efficient Broadcast in Multiradio Multichannel Wireless Networks
Energy Efficient Broadcast Multiradio Multichannel Wireless Networks
2012/6/10
The broadcast is a fundamental operation in computer and communication networks. We study broadcast in multiradio multichannel multi-hop wireless networks. Suppose through configuration, each node is ...
Performance evaluation for energy efficient topologic control in ad hoc wireless networks
Performance evaluation energy efficient topologic control ad hoc wireless networks.
2004/6/17
Minimizing total energy to keep an ad hoc wireless network symmetrically connected is an NP-hard problem. Recently, several greedy approximations have been proposed, based on k-restricted decompositio...