Optimal time slot assignment for networks

Details Optimal time slot assignment for networks Optimal time slot assignment for networks

2006-05-31

2011-12-06

Kincaid, Lester (Department: 2617)

Multiplex communications

Communication over free space

Having a plurality of contiguous regions served by...

C455S450000, C455S446000

Reexamination Certificate

active

08072928

ABSTRACT:
Terminals of a network are mapped cells. Time slots are allocated to the cells such that the time slots assigned to a first cell are reused as the time slots assigned to a second cell subject to a k-cell constraint whereby, according to the k-cell constraint, at least k cells separate the first and second cells. Additionally or alternatively, either a terminal j joining a cell i of the network is assigned a time slot in which it reports its presence in the cell i, or time slots are reclaimed within the cell i so that a reclaimed time slot can be allocated to the terminal j.

REFERENCES:
patent: 5233643 (1993-08-01), Naeini et al.
patent: 5515379 (1996-05-01), Crisler et al.
patent: 6359867 (2002-03-01), Ali-Vehmas
patent: 2002/0090937 (2002-07-01), Laroia et al.
patent: 2004/0028018 (2004-02-01), Cain
patent: 2006/0088048 (2006-04-01), Bahl
patent: 2007/0165620 (2007-07-01), Li et al.
patent: 2007/0211686 (2007-09-01), Belcea et al.
S. C. Ghosh et al., “Channel Assignment Using Genetic Algorithm Based on Geometric Symmetry”, IEEE Transactions on Vehicular Technology, pp. 1-16, Jul. 2003.
S. C. Ghosh et al., “A New Approach to Efficient Channel Assignment for Hexagonal Cellular Networks”, Intl. Journal of Foundations of Computer Science © World Scientific Publishing Company, vol. 14, No. 3, pp. 1-25, Jun. 2003.
D. J. Corbett et al., “A Partitioned Power and Location Aware MAC Protocol for Large Ad Hoc Networks”, Proc. of European Wireless 2005, Cyprus, 7 pgs., Apr. 2005.
W. Ye et al., “An Energy-Efficient MAC Protocol for Wireless Sensor Networks”, 10 pgs., presented at an energy-efficient MAC protocol for wireless sensor networks, 2002.
K. Sinha et al., “Broadcast Algorithms for Mobile Ad hoc Networks based on Depth-first Traversal”, Proc. Third Intl. Workshop on Wireless Information Systems (WIS), Apr. 13-14, 2004, Portugal, pp. 170-177.
K. Sinha et al., “Broadcast and Gossiping Algorithms for Mobile Ad hoc Networks based on Breadth-first Traversal”, Proc. 6thIntl. Workshop on Distributed Computing (IWDC), 12 pgs., Dec. 2004.
Y.-C. Tseng et al., “Fully Power-Aware and Location-Aware Protocols for Wireless Multi-hop Ad Hoc Networks*”, Proc. of IEEE Intl. Conference on Computer Communications and Networks (ICCCN), 6 pgs., 2002.
S. Basagni et al., “A Mobility-Transparent Deterministic Broadcast Mechanism for Ad Hoc Networks”, IEEE/ACM Transactions on Networking, vol. 7, No. 6, pp. 799-807, Dec. 1999.
M. Chrobak et al., “Fast Broadcasting and Gossiping in Radio Networks”, Proc. 41stIEEE Symp. Found. of Computer Science (FOCS' 2000), 7 pgs., 2000.
K. Perumal et al., “Neighbor Based TDMA slot assignment algorithm for WSN”, Proc. of IEEE Infocom, 3 pgs., 2005.
A. Sen et al., “A new model for scheduling packet radio networks”, Wireless Networks 3, pp. 71-82, (1997).
L.F.W. van Hoesel et al., Advantages of a TDMA based, energy-efficient, self-organizing MAC protocol for WSNs, IEEE Vehicular Technology Conference, Italy, pp. 1-5, 2004.
J. Grönkvist, “Comparison Between Scheduling Models for Spatial Reuse TDMA”, Proc. of the Affordable Wireless Services and Infrastructure, 5 pgs., Jun. 2004.
Chlamtac et al., “A spatial reuse TDMA/FDMA for mobile multi-hop radio networks,” InProceedings of IEEE INFOCOM, 1985, vol. 1, pp. 389-394.
Huson et al., “Broadcast scheduling algorithms for radio networks,” InIEEE MILCOM, pp. 647-651, 1995.
Zhu et al., “A five-phase reservation protocol (FDRP) for mobile ad hoe networks,”Wireless Networks, vol. 7, pp. 371-384, Jul. 2001.
S. S. Kulkarni et al. “TDMA services for sensor network,” InProceedings of the Third International Workshop on Assurance in Distributed Systems and Networks(ADSN), Hachioji, Tokyo, Japan, Mar. 2004.
Ramaswami et al., “Distributed scheduling of broadcasts in a radio network,” InNFOCOM, 1989, pp. 497-504.
S. C. Ghosh et al., “Coalesced CAP: An Improved Technique for Frequency Assignment in Cellular Networks,” IEEE Transactions on Vehicular Technology, vol. 55, No. 2, Mar. 2006, pp. 640-653.
J. Zangl et al., “Large ad hoc sensor networks with position estimation,” Proc. of 10th Aachen Symposium on Signal Theory, Germany, 2001, 6 pgs.
D. Niculescu et al., “Ad hoc positioning system (APS),” Proc. of IEEE Global Communications Conference (GLOBECOM), 2001, 6 pgs.
W.-H. Liao et al., “GRID: a fully location-aware routing protocol for mobile ad hoc networks,” Telecommunication Systems, Kluwer Academic Publishers, vol. 18, pp. 1-26, 2001.
S. Capkun et al., “GPS-free positioning in mobile ad-hoc networks,” Proc. of 34th Hawaii Intl. Conf. of System Sciences HICSS, pp. 1-15, Jan. 2001.
B. Chlebus et al., “Deterministic broadcasting in unknown radio networks”, Proc. of SODA 2000, pp. 1-10, 2000.
K. Nakano et al., “Randomized initialization protocols for ad-hoc networks”, IEEE Trans. on Parallel and Distributed Systems, vol. 11, pp. 749-759, 2000.
K. Nakano et al., “Uniform leader election protocols for radio networks,” IEEE Trans. on Parallel and Distributed Systems, vol. 13, No. 5, pp. 516-526, May 2002.

Affiliated with

Also associated with

Rating

Optimal time slot assignment for networks does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Optimal time slot assignment for networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal time slot assignment for networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4314045